1) For the algorithm, for j=1:n for k = 1: j-1 a(j, j) = a(j,j)-a(j,k)" a(j,k) end for i-j+: for k =1:j-1 ali,)-ali,j)+ali,k)* alj,k) ali,j) end end end a) Compute the exact number of flops (arithmetic operations) in the entire algorithm in terms of n. You do not need to multiply out the polynomials b) Compute only the highest-power term for the number of flops in the algorithm using integration