Head struct Node int data; Node* next; 3. (40 points) Given the single linked list above and the definition of a node, write the code to do the following. Assume that the list is reset to the picture above for each question. Each answer should only require statements, i.e., no loops. You can only use the pointers provided in the picture. Also draw the picture of the resulting linked list after each step. a) Move the node in between the nodes pointed to by A and B to the end of the list: b) Insert the node pointed to by N after the node A points to: c) Move the node pointed to by A to be the Head