given the single linked list below and the defenition of a node, write the code to the following.

the answer should only require statements i.e no loops. only use pointers provided. and draw the picture of the resulting linked list after each step

-delete the node pointed to by C(21)-*dont forget to release memory*

B 21 head N D class Node ( public: int data; Node" next; }