In a circular linked list oraganisation, insertion of a record involves modification of
no Aarzoo Varshney it is also 2 in case of beginning head pointer
Shaded node is the sentinel node.
In the above implementation insertion at any location (including beginning and end) requires modification of 2 pointers only.
About other implementations- If we don't count setting of head, tail or sentinel then insertion requires modification of 2 pointers only.
So Option B is correct
For creating automatas you can also ...