Enter Integer: 2

Enter Integer: 4

Enter Integer: 6

Enter Integer: 5

Enter Integer: 1

Enter Integer: 0

Enter Integer: 7

Enter Integer: 9

Enter Integer: 8

Enter Integer: 4

Sorted Array: 0 1 2 4 4 5 6 7 8 9

Description: Your task is to implement a selection sort algorithm in MIPS assembly language Your program must implement the following steps: . Prompt the user for a number that defines the size of an array . Prompt the user to enter n integers based on the size of the array . Store all integer values in an array in memory . Sort all integer values . Print out the sorted integer list Your program must implement the selection sort algorithm. Do not implement bubble sort or any other sorting algorithm To assist you in completing the assignment, review and trace the C implementation for selection sort algorithm. (source: Wikipedia) 1 a[0] to a[n-1] is the array to sort * 2 int i,j; 4 5 /* advance the position through the entire array */ 6 (could doj