Hey just kinda looking for the answer.

Write a C++ code to insert a node to the left of the node p in the double linked list shown below. (Each node has three fields: an data field that contains the information, and next and prev fields that contains pointers to nodes on either side. Exp->prev represents the address of the node to the left of node p) 2. Ty Dlist