22. Given the single linked list below and the definition of a node, write the code to do the following. The answer should only require statements, i.e., no loops. You can only use the pointers provided in the picture. 5 9 15 65 head B N 45 class Node { public: int data; Node* next; }; a. Move the node in-between the nodes pointed to by A and B (9) to the end of the list: Answer: Insert the node pointed to by N (45) after the node A points to (3) Answer: Move the node pointed to by A (3) to be the Head (move it to the beginning of the list): Answer: d. Make A point to the end of the list (don't move the node, just the pointer): Answer: e. Delete the node pointed to by B (15) (don't forget to release the memory)