Need help with the following MIPS asseembly question please!!

Write a MIPS program which will accept 1 positive integer, in effect n. Your program is to calculate P(n.r) for all possible combinations n and r from n down to 1. For example, the user enters 3, then your program should generate as output P(3,3) 6 P(3,2) 6 P(2,2) 2 P(2,1) 2 To make you program as modular as possible, be sure to implement the factorial function and P(n,r) as functions, passing and returning parameters as discussed in class. Your output should be a listing of all P(n,r) generated from n, in a form similar to the example above