Implement a MIPS assembly program that processes two integer arrays of size 20: Raw and Fresh. The Raw array is initialized with the values {2, 17, 28, 20, 6, 51, 20, 48, 12, 54, 3, 31, 15, 22, 46, 72, 41, 39, 30, 55}. The values for Fresh array will be read in (note: add proper prompt for reading data.) All elements of Fresh will be stored in memory. The program will output (i.e. display) the sum of two largest integers and the sum of two smallest integers of Raw and store the sum of two largest integers and the sum of two smallest integers of Fresh in memory locations right after where the last element of Fresh is stored. Test the program once and enter the Fresh arrays data of your choice.

Can you comment the steps.