Let A be a real nn matrix. Which of the following is the correct computational complexity of calculating the inverse matrix A1 ? Here, we assume that there exists the inverse matrix A1 of A. Consider the worst case with respect to A. Choose one from the following options. (a) (n) (b) (nlogn) (c) (n2) (d) (n3) (e) (n4) (f) (nn)