1. Please help me in this, Write a simple MIPS program that does the following (there is C++ sample code below to explain the logic): Create an array of 21 INTEGERS, you can put whatever you want in it, but they shouldnt be sorted. Without using recursion:

   1. Create a procedure to find the largest called Findlargest
   2. Create a procedure to find the smallest called Findsmallest.
   3. Create procedure called range, which is the difference between largest and smallest (range should call findLargest and findSmallest)

1. Here is the sample of C++ Code

2. #include "pch.h" //Theres no equivalent to this in MIPS so ignore it

   #include //theres no equivalent to this either.

   int theArray[] = { 5, 7, 1, 4, 9, 11, 15, 0, -1 };

   int findLargest()

   {

   int temp = theArray[0];

   for (int i = 0; i < 10; i++)

   if (temp < theArray[i])

   temp = theArray[i];

   return temp;

   }

   int findSmallest()

   {

   int temp = theArray[0];

   for (int i = 0; i < 10; i++)

   if (temp > theArray[i])

   temp = theArray[i];

   return temp;

   }

   int findRange()

   {

   return findLargest() - findSmallest();

   }

   int main()

   { std::cout << findLargest() << std::endl;

   std::cout << findSmallest() << std::endl;

   std::cout << findRange() << std::endl;

   }