Question &: In each of the following, highlight the only correct response. (12 marks) 1? The time complexity ofa program using asymptotic notation is afunction ar a) The instance characteristics b) The number of instructions c) The runtime performance. d) All of the above. e) None of the above. 2. Assuming s is a stack, with the usual StackType i implementation, the statement s items(o] s items[1] comparing the first 2 elements of s in a user program a) will compile and work as expected b) will compile but not work as expected c) will compile then cause a run-time eror d) will not compile as it violates encapsulation. e) will not compile because of a syntax error 3. In a queue implemented using as a linked structure, which of the front and rear pointers will change if we Enqueue into a non-empty queue? a) Both front and rear pointers will change. b) Only the front pointer will change c) Only the rear pointer will change. d) Neither front nor rear pointer will change. e) None of the above. 4. Which operation does not make sense for an array-based Unsorted List ADT? a) Deleting an item by index. b) Deleting an item by key c) Iterating over all list items. d) Retrieving an item by key e) None of the above. 5. Comparing recursion to iteration, it can be said that: a) The former is a particular case of the latter. b) The latter is a particular case of the former. c) The two are totally equivalent. d) The two cannot be compared. e) None of the above. 6. How many different Blinary Seurch Trees can be created that contain three nodes of key values 'A', B', and C"? a) 3. b) 4. c) 5. d) 6. e) 7. 5/9