Question 1 Figure B3 shows 3 nodes arranged as a single linked list, together with 5 pointer variables (pPrev, pNext, pHead, prail and pCur). Answer all the questions (a-f). Do not define any new variables, use only the variables defined in Figure B3. Each question is independent/ not related of each other. pPrev pNext BBB next FFF next HHH next NULL NULL pCur pHead pTail Figure B3: Single link list with 3 nodes Answer each question (a-c) below by redrawing the Figure B3 after execution of the code statements. a. Redraw the result to Figure B3, after the following statements execute. (2.5 marks) pPrev = NULL; pCur = pHead; pNext pCur->next; pTail = pNext->next; pHead = pCur->next; b. Redraw the result to Figure B3, after the following statements execute. (3 marks) pCurr = prail; pTail = prail->next; pPrev = pHead->next; pPrev->next = NULL; pHead->next = pCur; c. Redraw the result to Figure B3, after the following statements executes (2.5 marks) pPrev - pNext pHead; while (pNext != NULL) { pCur = pNext; pNext = pNext->next; }//endwhile d. Given a new node, NNodel shown below, write a C++ code segment to insert NNodel in between node#2 (FFF) and node#3 (HHH) in Figure B3. (3 marks) NNodel GGG next NULL e. Given a new node, NNo de 2 shown below, write a C++ code segment to insert NNode2 before node#1(BBB) in Figure B3. (2 marks) NNode2 next NULL f Write a C++ code segment to delete node#2 (FFF), and connect node#1 (BBB) and node#3 (HHH) in Figure B3. (2 marks)