0. You are going to write a MIPS program that does the following (there is C++ sample code below to explain the logic): 1) Create an array of 16 INTEGERS, you can put whatever you want in it, but they shouldn't be sorted. Without using recursion: a. Create a procedure to find the largest called findLargest b. Create a procedure to find the smallest called findSmallest. c. Create procedure called range, which is the difference between largest and smallest (range should call findLargest and findSmallest)