If

is the computational complexity of a given algorithm, which of the following statements is true?

Group of answer choices

For sufficiently large n$,$ the algorithm is less expensive than back substitution on a n x n linear system.

For sufficiently large n$,$ the algorithm is less expensive than Gaussian elimination on a n x n linear system.

For sufficiently large n$,$ the algorithm is less expensive than matrix multiplication of two n x n matrices.

None of the above are true.