Consider the linked list show in figure below. Assume that the nodes are in the usual info->link form. Use this to answer following questions. If necessary, declare additional variables. (Assume that list, temp, trail, and last are pointers of type nodeType) list trail last temp 1. Write C++ statements to do the following: (Answer any 3 from a to f) a. Set the info of the second node to 52 b. Make current point to the node with info 10. c. Make trail point to the node before temp. d. Make temp point to an empty list. e. Set the value of the node before trail to 36 1. Write a while loop to make current point to the node with info 10. 2. Write C++ statements to do the following: (Answer any 3 from a to d) a. Write a C++ code so that current traverses the entire list. b. Create the node with info 68 and insert it between trail and last. Delete the last node of the list and also deallocate the memory occupied by this node. After deleting the node, make last point to the last node of the list and the link of the last node must be nullptr. c. d. Delete the node with info 10. Also, deallocate the memory occupiesd by this node. o