3. In the array implementation of list, which of the following statements is NOT correct? A. The time complexity of insert_back member function (add a new element at the higher index end) is 0(1). B. The time complexity ofinsert_front member function (add a new C. The time complexity of remove_ back member function (remove the D. The time complexity of remove front member function (remove the element at the lower index end) is O(N). element from the higher index end) is 0 (1). element from the lower index end) is 0(1). 4. In the linked structure implementation of list shown in the following figure, which of the following statements can remove the node from the front correctly? 50 head -10 | 30 A. head = head->next; B. NodeType * ptr = head ; head -head->next; delete ptr ptr ptr->next; C. NodeType* ptr head; delete head; D. NodeType* ptr head; head->next ptr->next; When using the linked structure (shown in the following figure) to implement queue ADT, which of the following statements is NOT correct? 5. 20 30 50 10 hebd A. The insertion should be performed from the head and the deletion should be performed at the tail in order to have 0(1) for both operations; B. The insertion should be performed from the tail and the deletion should be performed at the head in order to have 0(1) for both operations; C. The time complexity of deletion performed at the tail is O(N); D. The time complexity of insertion performed at the tail is 0(1)