5- Which of the following has the smallest time complexity? A. 3n+5+21 B. Logn + 2 C. 3n+4 D. nlogn 6- What does a growth function show? A. How big a program must be before completed B. How many times a program can be re used C. Time or space utilization relative to the problem size D. How many lines a program is 7- Assume int[] scores = {1, 20, 30, 40, 50), what value does binarySearch(scores, 3) return? Novo a b. c d e. 0 -1 1 2 comparisons. 8- For a sorted list of 1024 elements, a binary search takes at most 100 11 do a. b. c . 512 6 9. An input that results in the shortest execution time is called the a. best-case input b. worst-case input c. average-case input 10- Show the output of the following code: public class Test public static void main(String[] args) { int[] x = (1,2,3,4,5) increase(x): Int( y = (1, 2, 3, 4, 5); increase(y[0]); System.out.println(x[0] + y[0]); > public static void increase(int[] x) { for (int i = 0; i } 00 11 22 21 12 a b. C. d. e