Linked Lists - Assignment

Rewrite Part II of Problem 2 using linked lists.  Store the student records of Part II as linked list nodes rather than entries in an array.  Also store the student records in descending order according to class % score.  Naturally, you may rewrite the ability of your ADT to add or delete elements to the linked list.  Use the data given in Part II of problem 2.

Now to completely clarify what must be done for credit for this problem.
1.	You must set up a Linked List structure to store the student nodes.  You CANNOT use an ArrayList in any form for this problem i.e. you cannot store them in an array list and then put them in a LinkedList.  You must start with a linked list structure.
2.	You are to create the addnode (), deletenode(), findnode() and addinorder() functions on your own as part of the LinkedList Generic Manager.  Do not build this code from the Java LinkedList Class.  I want you to have the experience of building and managing the list yourself.  To do this your LinkManager class should have;
a.	 A linklist node data structure that contains
i.	 the node value
ii.	 a pointer to the next node.
b.	A pointer to the head node in the list.
c.	A pointer to the tail node in the list.
d.	An integer number count that contains the number of nodes in the list.  (this is optional).
Due Feb 21, 10 program points and 10 test points.