(e) sum = 0; for (i=1; i<=n; i++) for (j=1; j<=n; j*=2) sum++; (f) sum = 0; for (i=1; i<=n; i*=2) for (j=1; j<=n; j++) sum++; (g) Assume that array A contains n values, Random takes constant time and sort takes n log n steps. for (i=0; i<n; i++) { for (j=0; j<n; j++) A[i] Random (n); sort (A, n); = = }