Problem $4.$ Draw the picture illustrating the final state of a doubly linked list after the following

operations are performed:

Create new node $v^v$

v$.$setData$($e$)$

v$.$setPrev$($p$)$

v$.$setNext$($p$.$getNext$0)$

p$.$setNext$($v$)$

$($p$.$getNext$(0).$setPrev$($v$)$