Consider the doubly linked list shown in the Figure below. Assume that the nodes are in the usual info-next-back form. (Assume that first, A, and last are pointers of type nodeType.) Use this list to answer Exercises 8 through 10. 8.What is the output of each of the following C++ statements? a. cout first->next->info; c. cout A->next->next->info; a. cout A> back->>info; b. cout first->next->back->info; 9.What is the value of each of the following relational expressions? b. A> next > next == last d. first->link->back == first 10.Write C++ statements to do the following. a Make B point to the last node in the list. b. Make B point to an empty list. c. Set the value of the node containing 15 to 35. d. Create and insert the node with info 10 after the node pointed to by A. Delete the node with info 24. Also, deallocate the memory occupied by this node