Suppose QR factorization is used to compute the solution of a square linear system, Ax = b; i.e., let m = n. (a) Find an asymptotic flop count for this procedure, and compare to the LU factorization algorithm. (b) Show that A(A)=(R).