A circular linked list is one in which the last node is connected to the first node. If we set a node curr equal to first node at the start of traversal, the condition to check if we have reached the end of the list then becomes: A. curr=-first B. curr.next==null C. curr.next.next==first D. curr.next==first