The time to run the code below is in: Eor (i-n i-1; i--) Eor j-1 j-0 ; i--) B. PQchange C. Array of handles D. Binary search for jen j+#2 ) ijs5; sum+-i*j; A. (nlogn) Which of the following is not true? B. n E On C. n E2 n logn What is n, the number of elements, for the largest table that can be processed by binary search using no more than 7 probes? Ft A. 31 B. 63 C. 64 D. 127 f(n)-nlgn is in all of the following sets, except Suppose there is a large, unordered table with n integers, possibly with repeated values. How much time is needed to determine the minimum value? A.6(1) B.6(logn) C.(n) D, (nlogn) When solving the fractional knapsack problem, the items are processed inthe following order A. Ascending order of weight B. Ascending order of SSS/b C. Descending order of weightD. Descending order of SSS/Ib Which of the following is not true regarding dynamic programming? A. It is a form of exhaustive search B. It is a form of divide-and-conquer C. A cost function must be defined D. The backtrace may be based on recomputing the cost function Suppose you are using the substitution method to establish a bound on a recurrence T(n) and you already know n) E 2(n) and TnEWhich of the following cannot be shown as an improvement