Draw the progression of the function call stack for the program when m=4. The form below is an example for m=2Consider the

a) Consider the Fib and main functions below int Fib(int k)f return 1; return Fib(k-1) + Fib(k-2); int main() f int m = 4; int n = Fib(m); return 0; Draw the progression of the function call stack for the programj Each time there is a new function call or a function returns, there should be a depiction of the call stack. For example, if the first line of the main function is "int m -2;", then the first few call stacks may look like this: Call stackLast function cal Last function return Function parameters Function (for function that is return value called or returned)(if applicable) (if applicable) (if applicable) Main N/A N/A N/A main Fib N/A Fib N/A main m=2 N/A Fib main