(I need help with this problems. I'm just not sure)

In a singly linked list, each node has which of the following? You can choose more than one correct answer, if appropriate a pointer to the next node a pointer to the previous node a pointer to the head of the linked list a pointer to the tail of the linked list Consider the following structure of a node for a linked list. struct Node { int key; Node *next; What will be the output of the following pseudo-code? Assume, head is a pointer to the first node of the following linked list. 5->2->8->2->9->2->11-> NULL Node pres head; int count 0; while(pres ! - NULL && count key 2) { count = count + 1; pres = pres->next; } cout key key == 0) if(head->next == NULL) O if (head == tail) O if(head NULL) O if (head->key==1) Consider the following structure for a linked list: struct Node { int key Node *next; }; class Linked List { private: Node *head; public: Linkedlist() { head - NULL; } void insert(Node *prev, int newkey); Node. searchList(int key) bool deleteAtIndex(int index); void printList; }; 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? Which of the following statements are true? 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. This code will cause a memory leak