pls help!!!!

C-3.25 Describe an algorithm for concatenating two singly linked lists L and M, into a single list L that contains all the nodes of L followed by all the nodes of M. 3.37 Write a class that maintains the top ten scores for a game application, implementing the add and remove methods of Section 3.1.1, but using a singly linked list instead of an array. C-3.25 page 147 (40 points) Write the code and test it. Modify the SinglyLinkedList class to contain the method: public void concatenate(Singly Linked List other) \{ ... \} P-3.37 page 147 (60 points) For simplicity you can use the SinglyLinked List with concatenate method. Help files: Homework2.zip