Write the code fragment that appropriately deletes the node pointed to by p $($data value $14)$ in the doubly linked list shown in the diagram. You can assume that p already points to node $14($I$\text{'}$m not asking you to write a loop to find node $14).$ Do this without declaring any other variables using only three lines of code.