Question

Given the following linked list and Node definition.

$1\mathrm{.}1[2$ pts$]$ As above shows, prv and current are pointers that is currently pointing to Node $17$

and $5$ respectively. Write segment of $C_{++}$code to insert a new Node with value $4$ after current

node and update the two pointers prv and current accordingly $($i$.$e$.$ current should point to Node

$4$ and prv should point to $5$ instead$).$

$1\mathrm{.}2[2$ pts$]$ Still as the original diagram shows, write segment of $C++$ code to delete Node $5$ and

update the two pointers prv and current accordingly $($i$.$e$.$ current should point to Node $-9$ and

prv should point to $17$ instead$).$

$1\mathrm{.}3[2$ pts$]$ Write segment of $C++$ code to compute sum of all integers stored inside above linked

list and save it inside a variable called sumint.