What does the following function do! What is the complexity? } public static void output (Node head) Node H = head; // head of the resulting linked list Node res = null; // temporary head of the resulting Linked lis Node tempList = null; do { Node curr = head; int Val = -1; do { if (head.data < curr.data) { } Val = curr.data; break; curr = curr.next; } while (curr != head); if (res == null) { } res = new Node (Val); tempList = res; else { tempList.next = new Node (Val); tempList = tempList.next; head = head.next; } while (head != H); print(res);