In Java and No Use of Java Libraries or Built-In Methods and Classes.

I only need answer to Question #2, but please read detail for Question #1 for full understanding. Full code please

1. Write a program that maintains the top 15 scores for the students of a class that has more than 15 students , implementing the add and remove methods using a singly linked list instead of an array. When adding and removing a student/score, the Singly Linked List should also sort itself so that the list remains ordered.

2. Perform the previous project, but use a doubly linked list. Moreover, your implementation of remove(i) should make the fewest number of pointer hops to get to the student at index i.