Question (iv). Let us consider the following data structure class Node data structure called Node given by E element: Node next; public Node (E o) element-o We also assume that the head of the list is given: private Node headi What does the following snippet of Java code? or (int i - l; i current previous.next: Node previous head: previous.next current.next: size- return current.elementi a Insert the element at position index in the list and return the element that was inserted in the list. b) Insert the first element of the list and return the element that was inserted in the list c) Insert the last element of the list and return the element that was inserted in the list. d) Remove the element at position index in the list and return the element that was removed from the list. None of the above. e)