Write a $C++$ code that will insert a doubly linked list pointed to by $yPtr$ after the node pointed to by $p$ of the doubly linked list pointed to by xPtr$.$ at the end of the doubly linked list pointed to by alist. The new doubly linked list will have the header node pointed to by the pointer variable xlist. The values of the pointer variables are known. $($Each node has three members: data contains the information, right and left members contain addresses to the nodes on either side. Ex$.$ p$->$right represents the address of the node to the right of node p$)($Do not submit any downloaded irrelevant code that will fetch Zero. Do not make a program with fictitious data. Just give the partial code that does what is asked.$)$

Solid arrow indicates; one node connects the another node.$)$

Use this declaration:

struct Node

$\{$

int data;

Node$*$ left;

Node$*$ right;

$\}$

Node$*$ xPtr$,$ yPtr$,$ zPtr$,$ p$,$ temp$1,$ temp$2$;

XP

$($The above doubly linked list has exact number of nodes as shown above$)$

yPtr

$($The above doubly linked list has exact number of nodes as shown above$)$

zl