need help writing a MIPS program that does the following (there is C++ sample code below to explain the logic):

1st problem:

1) Create an array of 21 INTEGERS, you can put whatever you want in it, but they shouldn't be sorted. Without using recursion:

2) Create a procedure to find the largest called find largest

3) Create a procedure to find the smallest called find smallest.

4)Create a procedure called range, which is the difference between largest and smallest (range should call find largest and find smallest)