QUESTION 7 Consider a linked list of n elements. What is the time taken to insert an element after head node? OO (n log n) 0 (1) O(n) O (log n) QUESTION 8 An empty singly linked list is indicated by: head == tail head == newNode tail ==newNode head == NULL QUESTION 9 Which of the following is an advantage of storing data in arrays? Access speed of elements in an array. Contiguous memory allocation. Fixed type and size of an array after creation. Shifting of array elements after inserting/deletion at head or middle. QUESTION 10 After running following statements for singly linked list, what t.next will be pointing to ? for (Node t = head; t.next != null && t.next.val !=target; t = t.next) ; // do nothing null or target node null or node before target null or node after target head node QUESTION 11 What will the infix expression (X+Y)/Z become in postfix form? OXY+Z/ O XYZ+/ O XYZ/+