In these questions, linked lists are constructed using the Node class defined as follows: public class Node { public int data; public Node next; } Also, there will be a special Node object called 'start' that either refers to the first Node object in the list or have a value of null if the list does not have any nodes ii) What is methodX doing to the list given? What does methodX assume about the list for it to work correctly? public void methodX (Node start) { Node p, q; p = start; q = p.next; while (q.next != null) { } p = 9; p.next = = q.next; null; }