1. What is the complexity of

void doit(int n)

{

if (n <1) return;

for (int i=0; i < n ; i++)

x++;

doit(n-1);

}

List the values of a, b, k

2. What is the complexity of

void doit(int n)

{

if (n <1) return;

for (int i=0; i < n ; i++)

x++;

doit(n-1);

doit(n-1);

}

List the values of a, b, k

a =number of calls at each level.

b = how the size is divided between calls.

k = the amount of work as an exponent