1. Write a C++ code to display the data member of the nodes in reverse order starting from the node pointed to by q and ending at the node pointed to by p of the doubly linked list shown below. (Each node has three members: data that contains the information, right and left members contain addresses to the nodes on either side. Ex. p->left represents the address of the node to the left of node p ( - dotted arrow indicates; there may be any number of nodes between the connecting nodes) head 1 11