I need help doing parts 1-5 for B and C. I have provided all of the necessary diagrams below. Please show work and if you are uploading a picture make sure its legible.

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 iven call statement 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 g own the sequence calls on page call from the main program? frame for th Figure 2.29 at the given point during execution