For each of the functions below, give as tight a worst-case runtime bound as you can. Express your answers with Big-O / Big-Theta notation.

Since you are seeking "tight" bounds, your answers should be expressed using Big-Theta -- unless you are especially candid and aren't sure if your upper-bound is indeed tight, you might say something like "I know the worst case is O(), but I have not been able to show that this is a tight bound..."

// 8 points int C(int a[], int n) i int x-0, i, j, k; for (1-0 ; i<>