1- Implement a linked-list of student data (a student data type includes id, name and GPA) as follows: Write a linked-list class including search, delete, append and remove, and write a main method to test it. 2- Implement a stack of student data using the linked-list in 1 as follows: write a stack class, and write a main method to test it. 3- Implement a doubled linked-list of student data as follows: Write a double linked-list class including search, delete, append (to the head and tail) and remove (from the head and tail), and write a main method to test it. 4- Implement a FIFO queue of student data using the double linked-list in 3 as follows: write a FIFO queue class, and write a main method to test it. (use java )