(h) Assume array A contains a random permutation of the values from 0 to n-1. sum = 0; for (i=0; i<n; i++) for (j=0; A[j] !=i; j++) sum++; (i) sum = 0; if (EVEN (n)) for (i=0; i<n; i++) else sum++; sum sum + n;