"Single linked list" - Java language

2. Fill the list with the following students using AddLast. 101 Mia 102 Alice 103 Ellie 104 Ruby 4. Remove student with id=103 using DeleteNode. 8. Delete last student using RemoveLast. Expected output The list 101 Mia 102 Alice 103 Ellie 104 Ruby Delete Student 103: The list -- 101 Mia 102 Alice 104 Ruby First Student is: 101 Mia Last Student is: 104 Ruby Delete Last Student: The list 101 Mia 102 Alice Is there a student with ID 1097 false