1. a) State clearly what you understand by an iterative algorithm and a recursive algorithm.

b) Given a function as below:

int fun(int n)

{

if ( n == 1) return 2;

else return (n + fun(n/2)) ;

}

What type of function is this: Iterative or recursive? Give justifications to your answer.

c) Evaluate the value of fun(5), by showing all the steps.

2. Given a function as below.

int Sum(int N)

{

if(N == 0 || N == 1) return 5;

else

return N + F(N 2);

}

Determine the value of F(9) using this function. Show all the intermediate steps.