$1$a$.$ Write a function combination which implements the combinatorial function $nCr$ in MIPS assembler.

A straightforward Java implementation without checks is given here:

int combinations$($int $n,$ int $r$

int $c=1$;

for$($int $i=r+1$;$in$;$i++)$

$c^{**}=i$;

for$($int $i=1$;$i$ n$-$r; $i++)$

$\frac{c}{?}=i$;

return c;

$\}$

$1$b$.$ The assemble instructions for multiplication and division, respectively, are mul and div.

Use the non$-$recursive factorial example with loops from the class as a starting point.

Write a main function which calls combinations twice with hardcoded $n$ and $r$ as follows:

a$.n=10,r=5($The answer is $252.)$

b$.n=100,r=10($The answer is $17,310,309,456,440$ which takes more than $32$ bits to represent!$)$

Exit your program with the proper syscall.

$1$c$.$ Test and run your program. Provide a screenshot of test runs for the two cases.

$($I haven't learned mflo or mfhi.$)$

Can someone help me edit my code so it can run and get the answer? When I ran the code I got the answer of $1203628800.$ I need the answers

from $1b,$ please.