Suppose algorithm A1 is o(n^4), A2 is O(n^4), A3 is (n^5), and A4 is (n^5). Mark the statements as True, False, or Cannot say.

a. It is possible that A4 is less efficient than A3:

b. If you plot T(n) for A4 against n for various values of n, the curve will lie between curves c*n^5 for two different values of c:

c. A1 is guaranteed to be more efficient than A4 for large values of n: