Write a recursive method that sorts a linked list implementation of the queue in ascending order....

 

Transcribed Image Text:

Write a recursive method that sorts a linked list implementation of the queue in ascending order. The method may only use another one linked list implementation of a queue and other non-array variables. Only the provided code for queue as provided on e-fundi may be used and the Queue class may not be altered in any way. Make use of the following heading. public static QueueAsMyLinkedList method(QueueAsMyLinkedList pl,int x) x is the number of objects in the queue. Example: list1=[3,5,8,7,1] System.out.println(method(list1,5)); // Display [1,3,5,7,8] Write a recursive method that sorts a linked list implementation of the queue in ascending order. The method may only use another one linked list implementation of a queue and other non-array variables. Only the provided code for queue as provided on e-fundi may be used and the Queue class may not be altered in any way. Make use of the following heading. public static QueueAsMyLinkedList method(QueueAsMyLinkedList pl,int x) x is the number of objects in the queue. Example: list1=[3,5,8,7,1] System.out.println(method(list1,5)); // Display [1,3,5,7,8]