QUESTION 4: ITERATORS [4pts] Given a doubly-linked list with the following Node definition: class Node next; Node prev;) If we assume that every linked list has both a head and tail pointer, answer the following questions: ZipGrade 6.If we are implementing an Iterator for this list class, which of the following is correct implementation for a hasNext () method if we initialize: Node current headi'! A. public T next) T temp = current.value; current = current . next; return temp ;} . B. public T next) f T temp = current; current = current . next; return temp; ) C. public T next) current current.next; return current;) D. public T next) i current = current.next; return current.value;h