(Easy) Consider solving AX = B for X, where A is n-by- n, and X and B are n-by-m. There are two obvious algorithms. The first algorithm factorizes A = PLU using Gaussian elimination and then solves for each column of X by forward and back substitution. The second algorithm computes A^-1 using Gaussian elimination and then multiplies X = A^-1 B. Count the number of flops required by each algorithm, and show that the first one requires fewer flops