1. (5\%) Suppose we have an empty digital search tree for 4-bit digits. Let us insert the number elements 10,3,8,4, and 9 in order into the tree. Which of the following sequences is the valid result (in terms of the preorder traversal) of the tree? (A) [10,8,3,4,9] (B) [10,3,8,4,9] (C) [10,3,4,8,9] (D) [3,10,4,8,9] (E) [3,4,8,9,10] (A) (B) (C) (D) (E) 2. (4\%) Which of the following statements is incorrect? (A) The amortized time complexity of "delete min" is O(logn) in Binomial heap. (B) Binomial heap offers no search mechanisms. (C) Nk=2k, where NK represents the total number of nodes in a Binomial tree with degree of k. (D) We typically merge identical numbers of degrees in the collection containing various binomial trees. (A) (B) (C) (D)