Java data-structure coursework

part I ------ Implement a cyclic and double-linked list object. Implement methods for basic actions like: search, insert, remove part II ------- +Implement a function called insert_data() to insert the followin data into the the part-i object 1 8 2 9 4 6 1 9 8 2 +Implement a function called remove_Nth(int n) that moves-on N elements and removes that N'th element of the list +Implement a function called remove_odds() that uses the remove_Nth function in order to remove all odd numbers from the list part-iii -------- Use the code in part-II as a stack in order to calculate mathematics like "+" , "-" , "*", "/" (convert in prefix or postfix and calculate on prefix or postfix with the help of a stack) If required take as granded that numbers are 1-digit I will imediatelly chose any coder bidding in the range of 20$-25$ but i will expect the job done within 24 hours please. Regards