For the following C codes, find the time-complexity by first finding the recurrence relation and then simplifying the recurrence.

(1) int blah(int n) {

int sum = 0;

int i, j;

if (n == 0)

return 1;

for(i=0; i<=n-1; i++)

{

for(j=0; j<=log(n); j++)

{

. . . loop-body . . .

}

}

sum = blah(n/2); sum += blah(n/2);

return sum;

}

(2) int blah(int n)

{

int sum = 0;

int i, j;

if (n == 0)

return 7;

for(i=0; i<=n-1; i++)

sum += blah(i);

return sum; }