Consider the following circular list, where p points to the FIRST node of the list.
Complete the following incomplete function to extend the circular linked list being
pointed by p ( the first node) by appending a singly linked list (pointed by q ) to the end
of the circular list. The resulting list will be one big circular list.
It is specified that the Circular list is NOT empty i.e. p cannot be NULL, but q may be
• Desired: the first node of the original circular list will be the first node of the newly
created big circular list.