1. For the following Example write the recursive algorithm
   1. Find an element in Array of n elements:
2. 2. To count # of elements in an array
   3. Factorial of integer n
3. 4. For the following recursive program identify the base and the recursive steps

int fact ( int n )

{

if ( n == 0 ) return 1;

return n * fact(n-1);

}

Base Case is:

Recursive step is :

1. 5. Explain how the factorial of 4 works
2. 6. The recursive algorithm is ----------------- select the correct answer

Linear logarithmic exponential Non

1. 7. The recursive algorithm time complexity is ( select the correct answer)
      1. O(n)
      2. O(n²)
      3. O(n-1) O(n)
      4. O(2ⁿ)
   8. The recursive algorithm of factorial has time complexity -----
2. 1. The recursive algorithm of Fibonacci has time complexity -----
3. 10. Determine the Possible Problems Infinite Loop of the following programs and how to fix this problem
4. 1. int bad ( int n ) {

If(n==0) return 1;

return bad(n-1); }

2. int bad ( int n ) {

return bad(n-1); }

1. 11. consider the Example Towers of Hanoi, write the steps to solve this problem in recursive approach, the problem is described as following:
       1. Move stack of disks between pegs
       2. Can only move top disk in stack
       3. Only allowed to place disk on top of larger disk
2. 12. List the advantage of Non recursive algorithms:
3. 13. List the advantage of recursive algorithms:
   14. List the disadvantage of recursive algorithms:

3RD WEG X V