Given the Java program

A. For each identifier in the following Java code explain iF Is Stack or Heap bound,

public class FibonacciCale {

static int maxNumber = 10;

Stack

Heao

public static int fibonacciR (int n) (

if (n == 0){

return 0;

if (n == 1 || n == 2){

return 1;

}

return fibonacciR (n-2) + fibonacciR (n-1);

public static void main(String args)) {

FibonacciCale fc;

fe = new FibonacciCalcO;

String message;

int i, m;

int sum = 0;

message = "Fibonacci Series of "+ maxNumbert

" numbers:

System.out.print (message);

for (i = 0; i < maxNumber; it +){

m= fc.fibonacciRi) ;

sum=sum+m;

System.out. print(sum+" ");

} } }

list ALL

a) static variables

b) stack-dynamic variables

c) explicit heap-dy variables

d) implicit heap-dynamic variables