Data Structure problem...

Assuming a linked list of n nodes, each node contains both data (which is item) and "link" to the next item (which is "next"), the head of the linked list references the list's first node, and the variable curr references the current node, the code fragment: Node curr -head; while (curr != null) System.out.println (curr.item)i currcurr.next; ) // end while requireswrite operations. O n+1 2(n 1) 2n O 2(n 1)