In JAVA : Implement 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. Write the code and test it.

Modify the SinglyLinkedList class to contain the method: public void concatenate(SinglyLinkedList other) { ... }

public static void main(String[] args) { SinglyLinkedList listL = new SinglyLinkedList<>(); SinglyLinkedList listM = new SinglyLinkedList<>(); listL.addFirst(26); listL.addFirst(13); listL.addFirst(72); listL.addFirst(91); System.out.println(listL);

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 For simplicity you can use the SinglyLinkedList with concatenate method.

Example of add remove methods in Section 3.1.1

public class GameEntry {

private String name; // name of the person earning this score

private int score; // the score value

/ Constructs a game entry with given parameters.. /

public GameEntry(String n, int s) { name = n; score = s;}

/ Returns the name field.

/ public String getName() { return name; }

/ Returns the score field. /

public int getScore() { return score; }

/ Returns a string representation of this entry. /

public String toString() {

return"("+ name +","+ score +")"; }