2-10 After inserting 7 into the 2-3 tree given in the figure, how many of the following statements are TRUE? (2 points) (51) The root still contains 9 only: (52) the tree grows higher (53) 4 and 9 are in the same nonleaf node: (54) the interior node containing 12 keeps unchanged. 12:- 1,2,3 4,6,8 9, 10 12.14 OA 3 OB. O OD 1 2-11 Suppose that a polynomial is represented by a linked list storing its non-zero terms. Given two polynimials with N, and N, non-zero terms, and the highest exponents being M and Me, respectively. Then the time complexity for adding them up is (2 point(s)) OA (M+ M) OB. O(M x M) OC ON x N:) OD. ON + N) 2-12 Given the adjacency matrix of a weighted graph as shown by the figure. I weight of its minimum spanning tree is (3 points) 3 10 1 5 7 2 14 8 14 78 6 O A 23 O B. 24 OC 17 OD. 18 2-13 Given input (4371, 1323, 6173, 4199, 4344.9679, 1989) and a hash function h(X) = X%10. If the collisions are solved by quadratic probing with table size being 10, then the indices of the input numbers in the hash table are: (-1 means the insertion cannot be successful) (2 point(s) OA 1,3,4,9,7.5.-1 OB. 1.3.4.9.5, 0.8 OC 1, 3, 3.9.4.9.9 OD. 1, 3, 4.9.5.0.2