ALGORITHM $GE(A|0..n-1,0..n|)$

$/$Input: An $n(n+1)$ malrix $A[0.n-1,0.n]$ ol real numbers

for ilarr$0$ to $n-2$ do

for jlarri$+1ton-1do$

for klarri $tondo$

$A[j,k]larrA[j,k]-A[i,k]**A\frac{j,i}{A}[i,i]$

a$.$ What does the algorithm compute?

b$.$ What is the basic operation?

c$.$ How many times does the basic operation execute?

d$.$ Analyze the worst, best, and average case complexity.