Note the error In algorithm $1,2$

incorrect:

$5.$ if A$[$j$]$ A$[$i$]$ then

Correct:

$5.$if A$[$j$]$ A$[$minj$]$ then

Consider the following preudocode for the selection sort algorithm and answer the questions below.

Algorithe $1$: Selection Sort.

Input Variables:

$n$ : size of array of integers

A: arroy of $n$ integers

Temporary Variables:

minj: index of current minimum number

temp: value of current ninimum number

$1,$ j: loop$/$array indexing variables.

for $1-$ e to $n-1$ do

minj$+1$

for $y=1+1$ to $n$ do

if A$[$j$]$ & $A[minj]$ then

min

If $mi=1$ then

temp$-$ A$[$ming$]$

minj$]-$ A $[$

a$)$ Write an ARM assembly code for the selection sort $($Algorithm $1).$ Assume A and $n$ are both variables stored in memory. Assume the array $A$ is defined as volatile.

b$)$ Simulate the program you have written using VisUAL ARM emulator with an input array $\{15,60,2,7,39,77,5\}.$ Include a snapshot to show that your program produced the correct output. Make sure to include both registers and memory view in your snapshots. Use the "View Memory Content" to show the sorted array.

c$)$ Consider a modified version of the algorithm called Algorithm $2.$ In this version, the search for the index of the minimum number is performed by a function call. Repeat Part a$)$ using Algorithm $2.$ You may need to add instructions before and after the function call to do what is necessary to perform the function call. Use the stack to preserve and restore all needed registers before and after the function call.

Algorithm $2$: Selection Sort.

Input Variables:

$n$ : size of array of integers

A: array of $n$ integers

Temporary Variables:

minj: index of current minimum number

temp: value of current minimum number

$i,j$ : loop$/$array indexing variables.

for $1+$ to $n-1$ do

minj$=$findMIN$(1,n,A)$

if minj $=1$ then

temp $-$ A $[$minj$]$

$A[minj]+A[1]$

$A[i]+$temp

int fundMIN$($int $i,$ int $n,$ int$*$ A$)$:

minj $+1$

for $j+i+1$ to $n$ do

if $+jA[j]$ then

minj $+j$

return minj

$d$