MCQ (NEED CORRECT ANSWERS ONLY Ctrl) 17. 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) a) 1, 3, 3, 9, 4, 9, 9 b) 1, 3, 4, 9,5, 0,8 c) 1, 3, 4, 9,5, 0,2 d) 1, 3, 4, 9, 7,5, -1 18. Suppose that a polynomial is represented by a linked list storing its non-zero terms. Given two polynimials with Ni and N2 non-zero terms, and the highest exponents being Mi and M2, respectively. Then the time complexity for adding them up is: a) O(N1XN2) b) O(N1+N2) c) O(Mi+M2) d) O(MixM2) 19. Given a tree of degree 3. Suppose that there are 3 nodes of degree 2 and 2 nodes of degree 3. Then the number of leaf nodes must be a) b) c) 6 d) 5