In the following code snippet, array A of length n contains a

permutation of integers 0, 1, . . . , n 1.

sum = 0; for (i=0; i

for (j=0; A[j]!=i; j++) sum++;

Derive its

(a) worst-case asymptotic running time and (b) best-case asymptotic running time.