MIPS Solution

In this project, you are required to write a recursive program for binomial coefficient computation. In combinatorics, the binomial coefficient, 𝑛𝑛𝑘𝑘, is the number of distinct k-element subsets of an n-element set. (i.e., the number of ways that k things can be 'chosen' from a set of n things.) Hence, 𝑛𝑛𝑘𝑘 is often read as "n choose k" and is called the choose function of n and k. There are several alternative notations, includes
𝐶𝐶(𝑛𝑛, 𝑘𝑘) and 𝐶𝐶𝑘𝑘𝑛𝑛 . There are several ways to compute the binomial coefficient. A recursive definition is listed below.

𝐶𝐶𝑘𝑘𝑛𝑛 = 𝐶𝐶𝑘𝑘𝑛𝑛−1 + 𝐶𝐶𝑘𝑘−1𝑛𝑛−1, where 𝐶𝐶0𝑛𝑛 = 𝐶𝐶𝑛𝑛𝑛𝑛 = 1 and 0 ≤𝑘𝑘≤𝑛𝑛.

Please submit your source code according to the following rules:
1- Write down enough comments such that you would receive higher scores.
2- The filename is your student ID (e.g., B12345678.asm).

Example:

Please input first positive integer n:
10
Please input second positive integer k:
2
The binomial coefficient C(10, 2) = 45

Please input first positive integer n:
10
Please input second positive integer k:
5
The binomial coefficient C(10, 5) = 252