Question 2 (1 point) Which of the following is greater than O(n 2)? nA3/(sqrt(n) (15A10) n12099 n 1.98 (2420) n Question 4 (1 point) The most asymptotically efficient algorithm for multiplying n xnmatrices to date, has a run time of O(n 2.376). True False Question 5 (1 point) Name an algorithm that works by recursively breaking down a problem into two or more sub- problems of the same or related type, until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give a solution to the original problem Question 6 (1 point) Strassen's algorithm, runs in O(n 2.81) time, which beats the straightforward method of multiplying square matrices. True False Question 7 (1 point) The first part of the proof of the master theorem analyzes the recurrence T(n)a(T(n/b) f(n)under the assumption that n is an exact power of b >1 where b need not be an integer. True False