LInked list and prority queue

Linked list and priority queue In this exsercise, you are asked to implement a prority queue using linked list data structure to store and manage a small database of sutudent objects. 1) Define and implement a student class [login to view URL] having the following attributes : a) static int ID b) private String first_Name c) private String last_Name. The variable ID is used to assign each student a unique integer value in an incremental fashion ([login to view URL] the first student ID = 1). This class must contain the required set of get/set/toString methods to store, access and display relevant informarmation. 2) Implement a Node class [login to view URL] (or [login to view URL]) as the building block of a linked list data structure. The Node object must store a single Student object, as well as two references to the next and previous nodes. 3) Use the Node object you implemented, to implement a min priority queue class named [login to view URL] (or [login to view URL]). The priority queue must organize Node objects based on one of the attributes of the Student object, which is stored in each corresponding Node. The choice of attribute to be used to organize the priority queue with, must occur during the run time and by asking the user. The priority queue must provide all basic methods namely insert, remove, peek Min, isFull, isEmpty, and display. The display method must print a sorted list of Student objects every time a Node is inserted or removed from the priority queue. The initial size of the priority queue should be equal to 5. Every time the queue becomes full, it must automatically re-size itself by doubling the number of nodes it can store. 4) Write a driver program named [login to view URL] (or [login to view URL]) to allow the user to fully test the functionality of the priority queue. The driver program must initialize a priority queue and also allow the user to perform the following tasks a) Choose a desired Student attribute (first name, last name or ID) to be used as the key to organize the priority queue with. In a single run, once the choice of attribute is made, it can no further be changed. b) Allow the user to add as many Student objects as needed to the priority queue. Note that objects must be stored at a position based on the attribute value chosen in a. When the queue is full, it must au tomatically re-size the queue and show appropriate message to the user. For every new Student object, the user must be able to input first name and last name attributes. Note that student ID must be automatically assigned in an incremental fashion. c) Allow the user to remove a Student object using the key attribute chosen in a. If the key does not exist, a related message must be shown to the user. d) Allow the user to print all the students from the priority queue in the right order. e) Allow the user to print the size of the queue and the total number of items stored in it at any time. Your submission must include a folder containing an eclipse project. In the source folder of the project, you must have exactly four files namely: [login to view URL] or [login to view URL], [login to view URL] or [login to view URL], [login to view URL] or [login to view URL], as well as the driver program [login to view URL] or Main.cpp.