The problem I need help with is 2(c) below for the five parts.

For reference here are figures 2.28, 2.29, 2.30

All help is appreciated

se below has five parts, as follows: (1) Draw the call tree in of Figure 2.30 for the function bincoeff ) of Figure 2.28 ent from the main program. (2) Write nce of calls and returns using the indentation notation 92. (3) How many times is the function called, including the (4) What is the maximum number of stack n the run-time stack during the execution, not counting the e main program? (5) Draw the run-time stack in the style of 2. Each exerci assuming the given call statem own the sequence calls on page call from the main program? frame for th Figure 2.29 at the given point during execution