Let the variable list represents a pointer to the head of linked list of nodes, called LinkedNode; where LinkedNode is defined as follows: class LinkedNode {int data; LinkedNode next; LinkedNode(int i) {data = i; next = null;}} A node temp must be inserted at the front of the list. (where temp is defined as: Linked Node temp = new LinkedNode(200)) Which of the following sets of codes best describes the situation. Select the one right response. I IV III II When inserting nodes in a linked list the best method of keeping a sorted list is the method of inserting at the back and the front