The general solution of the differential equation y apostrophe plus y over x equals x y to the power of $5$ comma space space left parenthesis x greater than $0$ right parenthesis is

a$.$

y equals fraction numerator $1$ over denominator cube root of x squared left parenthesis $3$ plus c x right parenthesis end root end fraction

b$.$

y equals fifth root of fraction numerator $3$ over denominator x squared left parenthesis $5$ plus $3$ c x cubed right parenthesis end fraction end root

c$.$

y equals root index $7$ of fraction numerator $5$ over denominator x squared left parenthesis $7$ plus $5$ c x to the power of $5$ right parenthesis end fraction end root

d$.$

y equals fraction numerator $1$ over denominator fourth root of x squared left parenthesis $2$ plus c x squared right parenthesis end root end fraction

e$.$

y equals root index $6$ of fraction numerator $2$ over denominator x squared left parenthesis $3$ plus $2$ c x to the power of $4$ right parenthesis end fraction end root 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.Q$\mathrm{.}1.$ Consider the following pseudocode for the selection sort algorithm and answer the

questions below.

Algorithm $1$: 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.

$1$: for ilarr$0$ to $n-1$ do

minjlarri

for jlarri$+1$ to $n$ do

if minjlarrjminj$$ilarrA$[minj]A[minj]larrA[i]A[i]larrA[j]$ then

minjlarrj

$if$ minj$$i then

temp larrA$[minj]$

$A[minj]larrA[i]$

$A[i]larr$ temp