static class Node public Node Cint data, Node next) this.data-data; this.next-next; h public int data public Node next; Inumber of nodes in list int N; Node first; I/reference to the first node in the list // set to true to also see Success notifications for tests // set to false to only see Failure notifications for tests static boolean showMeSuccess = true; //deleteNodeInPos // delete the node in position k (where k is between 0 and N-1 inclusive) 77positions are numbered starting with 0 // preconditions: 0 =1 ; list is not empty // You can solve the problem iteratively or recursively //an iterative solution must use a single loop a recursive solution may use a single helper function // You may not use/call any other functions, java classes or java utilities public void deleteNodeInPos (int k) // To do 1. Complete this method