nk A circular linked list is as shown in the figure below, it is a list of linked nodes, where each node has a pointer to it successor in the list (there are NO backward pointers). The list has ONE head pointer pointing to one node in the list. Assume the list is not sorted and has N nodes Head 12 18 100 30 5 10 Deliverables of Question 5 (1) Write a pseudocode for an efficient algorithm for each of the following operations (no executable is needed) - Insertion of a new node - Deletion of a node with value v - Searching for a node with value v (2) State the worst case complexity (in Big O notation) for each of the three operations in 5.1 (3) Given your input list, the header pointer, and an addition pointer P (as indicated in the figure below). The goal is to delete the node pointed to by P and fix the pointers of the linked list. An nave algorithm would do that in O(N). Your task is to write a pseudocode for an efficient algorithm that can this operation in O(1), i.e., constant number of operations regardless of N Head 12 18 100 30 10 7