In general for smaller matrices and reasonable​ entries, for which value of n is the computational complexity of​ A^n EQUAL to that of​ (P^{-1}AP)^n ?A. 6B. 2C. 3D. 1