1. A circular doubly linked list. list 1 2 3 4 5 Next Next Next Next Next Prev Prev Prev Prev Prev After each of the following assignments, indicate changes made in the list by showing which links have been modified. The second assignment should make changes in the list modified by the first assignment, and so on. (1). List->next->next->next = list->prev; (2) list->prev->prev->prev = list->next->next->next->prev; (3) list->next->next->next->prev = list Sprev->prev-prev: (4) list->next = list->next->next; (5) list->next->prev->next = list->next->next->next; 2. How many nodes does the shortest linked list have? The longest linked list? 3. Refer to the node definition and code in P92 and p80. The following assignments created a linked list with three nodes. Create this list with only one assignment p = new IntSLLNode(50); p = new IntSLL. Node(8, p); p = new IntSLLNode(10, p); 4. Write a code to delete an ith node from a linked list with int type of info. Be sure that such a node exists