|Question||In Java and have notes in your code so I see what you aredoing. must also be using linked list
One of the advantages of mergesort is that it can easily beadapted to sort a linked list of values. This is because thealgorithm retrieves the values from the two lists being merged inthe order that they occur in the lists. If the lists are linkedlists, then the algorithm can simply move down the list node afternode. With heapsort or quicksort, the algorithm needs to movevalues from random locations in the array, so they do not adapt aswell to sorting a linked list. Write a program that sorts a linkedlist of integers into a linked list and then sort the linked listusing mergesort. This will require additional linked lists, but youshould use linked lists, not arrays for all your list storage.