Let the variable list represents a pointer to the head of a linked list of nodes, called Linked Node: where LinkedNode is defined as follows: class LinkedNode {int data; Linked Node next; Linked Node(int i) {data = i; next = null}} A node called temp must be inserted at the front of the list. (where temp is defined as: Linked Node temp new LinkedNode(2000)) Which of the following sets of codes best describes the situation. Select the one right response. I LinkedNode current = list; while(current ! = null) current = temp; II temp.nxt = list; list = temp; III temp = list; list = temp; IV LinkedNode current = list; while (current. next ! = null) current - temp; Select one: a. III b. I c. II d. IV