QUESTION 4 Consider the following statemens. 1) There are 12 possible binary search trees that only contain the four keys 1, 2, 3, 4. m2 for some integer m. One can determine the m smallest elements of the 2) Suppose you have an unsorted array of n elements, where array in O(n) time O Both statements are true. 1) is true, 2) is false. 1) is false, 2) is true. Both statements are false