Draw the call tree, as in Figure 2.30, for the function binCoeff of Figure 2.28 for the call statement from the main program: (e) binCoeff (4, 2)

Part 1) Draw the call tree for the call statement from the main program. (See Fig 2.30 for an example)

Part 2) How many times is the function called? __________________

Part 3) What is the maximum number of stack frames on the run-time stack during the execution, including main). __________________

Part 4) The sequence of calls and returns for the program.

#include using namespace std; Figure 2.28 A recursive con binomial coeffi int binCoeff (int n, int k) t int yl, y2: if ((k0) return 1: (n-k)) else f y1 - binCoeff (n 1. k); // ra2 y2 binCoeff (n - 1, k 1); // ra3 return yl + y2: int main cout