What does a run-time analysis usually countS pts a. The number of arithmetic and other operations required fot the b. The number of megabytes required for the program to run c. The number of seconds required for the program to run. d. The number of seconds plus the number of megabytes Total 100 points, 30 ins and other operations required for the program to rn 2. What do we call an input that results in the longest execution timet a. Best-case input. b. Average-case input c. Worst-case input. d. None of the above. 3. For the following big-Oh notation in terms of n, which runs the fastest. cs p a. n b. (log(n))2 c. n d. log(n) 4. What is the Big Oh of the following terms: a. 5n2 +2 is b. n+ 1000 log(n)+ 7 is: c. 5n3 +10n2-n-8 is: d. 3n2 + 2"is: Analyze the running time of each piece of the following code, give best big in terms of n. 5. for ( i = n; > 0; --) Answer:_ b. sum0; for(k 0; k