Question 13

In a queue, elements are deleted from the FRONT and inserted at the REAR.
In a circular singly linked list:

• The nodes are arranged in sequence from FRONT to REAR: FRONT -> Node2 -> ... -> REAR.
• To make the list circular, the next pointer of the REAR node must point back to the FRONT node: REAR->next = FRONT.
• When inserting a new node new_node at the rear in $O(1)$ time:
  new_node->next = REAR->next; (which is FRONT)
  REAR->next = new_node;
REAR = new_node;
• When deleting the front node in $O(1)$ time:
  FRONT = FRONT->next;
REAR->next = FRONT;

Therefore, the next pointer of the rear node points to the front node (Statement II is CORRECT).
Statement I claims that the next pointer of the front node points to the rear node, which is only true for a list of length 1, not in general.

Thus, statement II only is correct, matching option B.