Please answer the following questions.

A programming technique in which a function calls itself is called c) queue d) recursion . a) Array b) stack Each recursive algorithm must have at least one base case, as well as the general (recursive) case a) True b) False 2. c) none 3. In Loop repetition test determines whether to exit a) Iteration b) Recursion c) none 4. Merge Sort is a recursive sorting procedure that uses at mostcomparisons a) O(n lg(n)) b) O(n2 Igtn)) nlgn)) d) O(n lg(n) 5. In Merge Sort if n