What differentiates a circular linked list from a normal linked list?Select one:a.You cannot have the ‘next’ pointer point to null in a circular linked listb.It is faster to traverse the circular linked listc.You may or may not have the ‘next’ pointer point to null in a circular linked listd.Head node is known in circular linked list

To determine what differentiates a circular linked list from a normal linked list, let's analyze each option step by step:

a. You cannot have the ‘next’ pointer point to null in a circular linked list

• In a circular linked list, the last node's 'next' pointer points back to the head node, creating a circular structure. Therefore, the 'next' pointer of the last node cannot be null. This statement is true for circular linked lists.

b. It is faster to traverse the circular linked list

• The speed of traversal depends on the specific implementation and use case. This statement is not necessarily true as a general rule. Traversal speed is not a defining characteristic that differentiates circular linked lists from normal linked lists.

c. You may or may not have the ‘next’ pointer point to null in a circular linked list

• This statement is incorrect because, in a circular linked list, the 'next' pointer of the last node must point to the head node, not null.

d. Head node is known in circular linked list

• While the head node is typically known in both circular and normal linked lists, this is not a unique differentiating factor for circular linked lists.

Based on the analysis, the correct answer is:

a. You cannot have the ‘next’ pointer point to null in a circular linked list