Could someone please translate the following code into pseudo code

 class LinkedList { static Node head; class Node { int data; Node next, child; Node(int d) { data = d; next = child = null; } } // A utility function to create a linked list with n nodes. The data // of nodes is taken from arr[]. All child pointers are set as NULL Node createList(int arr[], int n) { Node node = null; Node p = null; int i; for (i = 0; i < n; ++i) { if (node == null) { node = p = new Node(arr[i]); } else { p.next = new Node(arr[i]); p = p.next; } p.next = p.child = null; } return node; } // A utility function to print all nodes of a linked list void printList(Node node) { while (node != null) { System.out.print(node.data + " "); node = node.next; } System.out.println(""); } Node createList() { int arr1[] = new int[]{9, 8, 4, 7, 13}; int arr2[] = new int[]{5, 12, 3}; int arr3[] = new int[]{16, 21}; int arr4[] = new int[]{23, 41}; int arr5[] = new int[]{34, 30}; int arr6[] = new int[]{10}; int arr7[] = new int[]{14}; int arr8[] = new int[]{9}; /* create 8 linked lists */ Node head1 = createList(arr1, arr1.length); Node head2 = createList(arr2, arr2.length); Node head3 = createList(arr3, arr3.length); Node head4 = createList(arr4, arr4.length); Node head5 = createList(arr5, arr5.length); Node head6 = createList(arr6, arr6.length); Node head7 = createList(arr7, arr7.length); Node head8 = createList(arr8, arr8.length); /* modify child pointers to create the list shown above */ head1.child = head2; head1.next.next.next.child = head3; head3.child = head4; head4.child = head5; head2.next.child = head6; head2.next.next.child = head7; head7.child = head8; /* Return head pointer of first linked list. Note that all nodes are reachable from head1 */ return head1; } /* The main function that flattens a multilevel linked list */ void flattenList(Node node) { /*Base case*/ if (node == null) { return; } Node tmp = null; /* Find tail node of first level linked list */ Node tail = node; while (tail.next != null) { tail = tail.next; } // One by one traverse through all nodes of first level // linked list till we reach the tail node Node cur = node; while (cur != tail) { // If current node has a child if (cur.child != null) { // then append the child at the end of current list tail.next = cur.child; // and update the tail to new last node tmp = cur.child; while (tmp.next != null) { tmp = tmp.next; } tail = tmp; } // Change current node cur = cur.next; } } public static void main(String[] args) { LinkedList list = new LinkedList(); head = list.createList(); list.flattenList(head); list.printList(head); } }