its a java algorithm question its urgent thank you can you describe it detailed please

Algorithm Design Context) 8. (20 points) Suppose that a linked list is formed from objects that belong to the class: class Node int item; Node next; } // An item in the list. // Pointer to next item in the list. Given a single linked list as input, write a Java method to sort it. Your algorithm must run in time better than O(N?). You may only use constant size (i.e. O(1)) additional memory and your algorithm should work on the linked list itself (i.e. meaning you cannot allocate another array to temporarily hold the items. No points will be given if you use an extra array.). a) First explain how your method works in 2-3 sentences. Explain which sorting algorithm you will modify. b) Secondly, write the Java code for the method. The method should have a parameter of type Node, which is the reference to the head of the list (Note: you may use a helper function if necessary): public static void sort (Node head ) { c) Explain the big-O complexity of your algorithm