Trying to solve the below problem based on the tree under it. This is from Chapter 2 of Computer Systems (Fourth Edition) by J. Stanley Warford. 2.2c Part 1) Draw the call tree for the call statement from the main program for binCoeff (3, 2). 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) In what order does the program make the calls and returns. Main program Figure 2.30 The call tree for th Figure 2.28. BC (3, 1) BC (2, 1) BC (2, 0) BC (1, 0) Show transcribed image text