Consider a linked list implementation where we have both a pointer to the head of the list (called head) and a pointer to the tail of the list (called tail). For this new data structure, which of the following operations will require traversing the whole list? Insert a new node after the last node . Delete the last node Insert a new node before the first node Delete the first node Question 9 Deallocating memory pointed to by the head of a Linked List always deallocates the memory used by whole Linked List, True or False? True - False Question 10 You want to write code that will delete the node with the Data value 4 from this linked list. You start by initializing pointers prev and pres so that prev points to NULL and pres points to the head of the list, as shown: 2 3. 4 NULL Data next Data next Data next Data next NULL prev Head pres Your code traverses the list so that prev and pres are always offset by one. For example, after one iteration, prev points to the head and pres points to head->next, as shown: 1 2 3 4 NULL Data next Data next Data next Data next When you delete pres, what will be the value of prev->Data? Head prev pres 4 NULL 3 2