Algorithm Lab Questions 5.6 Suppose T,( N ) = 0(H N )) and Ti(N )-O(F(N )), which of the following are true? a. Ti(N) T(N)-O(FUN)) c. Ti(N)/T(N) (1) e. none of the above 5.7 Programs A and B are analyzed and found to have worst-case running times no greater than 150N log N and N2, respectively. Which of the following statements does the analysis imply? a. Program A will run faster on average for sufficiently large N. b. Program B will run faster on average for small N. c. Program A is probably simpler to code than program B. d There exists some input for which program B takes longer than program A. e. none of the above 5.8 An algorithm takes 5 seconds for an input size of 100. If the algorithm is quadratic, approximately how long does it take to solve a problem of size 200? a. 10 seconds b. 15 seconds c. 20 seconds d. 25 seconds e. none of the above 5.9 An algorithm takes 15 seconds to solve a problem of size 1000. If the algorithm is quadratic, how large a problem can be solved in one minute? a. 2000 b. 4000 c. 6000 d. 60000 e. none of the above