Let A be a square matrix size $$n \times n$$. Consider the following pseudocode. What is the expected output?

C = 100; 
for i = 0 to n do 
for j = 1 to n do 
 { 
      Temp = A[ i ][ j ] + C ; 
      A[ i ][ j ] = A[ j ][ i ] ; 
      A[ j ][ i ] = Temp - C ; 
 } 

 for i = 0 to n do 
 for j = 1 to n do 
 output(A[ i ][ j ]);

Which of the following statements are CORRECT?

1) Static allocation of all data areas by a compiler makes it impossible to implement recursion.

2) Automatic garbage collection is essential to implement recursion.

3) Dynamic allocation of activation records is essential to implement recursion.

4) Both heap and stack are essential to implement recursion.

Consider the function func shown below:

int func(int num) 

{ 

         int count = 0;

         while(num)

         {

                count++;

                num >>= 1;

         }

  return (count);

} 

The value returned by func(435) is _________.

Suppose n and p are unsigned int variables in a C program. We wish to set p to $${}^n{C_3}$$. If n is large, which one of the following statements is most likely to set p correctly?