This is a practice problem for a Computer Organization class and must be done in MIPS:

The goal is to write a complete program in MIPS assembly language that implements the selection sort algorithm to sort an array of integers in both ascending and descending order. The program must be based on the C code presented below. I have attached the C code.

main) int j, k, temp, min, direction; int length 9; int list [-7. 9. 4, 3. 8. 1, 6, 2, 5 printf("Enter 0 to sort in descending order.n) printf("Any number different than 0 vill sort in ascending order.Ln") scanf(d", adirection); printf("Before Sort:In printData(list, length); for 0; k min) else return( j min); else return( jmin ) ; printData( int theList, int aize ) int k; for( k 0; k min) else return( j min); else return( jmin ) ; printData( int theList, int aize ) int k; for( k 0; k