Question 4 1 pts Consider the following structure for a linked list: struct Node { int key Node next : class LinkedList private: Node *head; public: LinkedListo head = NULL; } void insert(Node *prev, int newkey); Node" searchList(int key); bool delete At Index(int index); void printListo; }; Assume we have already inserted one element into the linked list. Consider the following code segment: 1. Node* temp = new Node; 2. temp = head 3. delete temp; Which of the following statements are true? This code will cause a memory leak There are no issues in this code This code inserts a new node at the beginning of a linked list Line 3 will delete the Node allocated in Line 1 Question 5 1 pts I am trying to delete the a node in the middle of a singly linked list. I currently have a pointer called pres, which points to the address of the node I want to delete and a pointer called prev, which points to the address of the node before the one I want to delete, as seen below: data next data next data next data next 3 10 2 1 NULL head prev pres What do I do to delete the node pointed to by pres? delete pres; delete prev; delete pres; prev->next = head; delete pres; prev->next = pres->next; delete pres; prev->next = NULL; delete pres; O pres->next = prev->next; delete prev