For the algorithm,

for j=1:n

for k=1:j-1

a(j,j)-a(j,k)*a(j,k)

end

for i=j+1:n

for k=1:j-1

a(i,j)=a(i,j)-a(i,k)*a(j,k)

end

end

end

Compute the exact number of flops in the entire algorithm in terms of n. You do not need to multiply out the polynomials.