Question 3 (2+2+2+2+2 = 10 points): Circle one answer: (a) Suppose a BST is traversed in the following order recursively: Right, root, left. The output sequence will be (A) Ascending Order (B) Bitonic Sequence (C) No specific order (D) Descending order (b) The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum (A) Three nodes (B) Two Nodes (C) one node (D) Any number of nodes (c) The ideal goal of hashing is to produce a search that takes (A) (1) time (B) O(n) time (C) O(n log2n) time (D) O(login) time (d) A characteristic of the data that binary search uses but the linear search ignores is the (A) Order of the elements of the list. (B) Length of the list. (C) Maximum value in list. (D) Type of elements of the list. (e) An ADT is defined to be a mathematical model of a user-defined type along with the collection of all operations on that model (A) Cardinality (B) Assignment (C) Primitive (D) Structured