by java

1. Create a single linked list for students (id, name).

and the following methods:

a. First.

b. Last.

c. AddLast.

d. RemoveLast.

e. DeleteNode which takes one parameter (int key). This will delete the node with id=key.

f. Find: which takes one parameter (int key). If the key wasnt found display return false If the key was found return True.

g. DisplayList.

2. Fill the list with the following students using AddLast. 101 Mia 102 Alice 103 Ellie 104 Ruby

3. Display the list using DisplayList.

4. Remove student with id =103 using DeleteNode.

5. Display the list using DisplayList. 6. Display the first Student using First.

7. Display the last Student using Last.

8. Delete last student using RemoveLast.

9. Check if there is a student with ID 109? Using Find.