Write and test an ARMv$8$ program to sort an array of elements. The following C code segment illustrates how we can sort the element of an array.

int start $=0$;

int end $=10$;

int $a[79,55,94,48,19,13,45,2,3,99]$;

int smIndex, bigIndex;

void main$()\{$

while $($start $$ end$)\{$

$/*$ returns the index of next smallest element $*/$

smIndex $=$ findSmallest $($&a$,$ start, end$)$;

swap $($&a$,$ start, smIndex$)$; $/*$ swap smallest with a$[$i$]*/$

start $=$ start $+1$;

$/*$ returns the index of next largest element $*/$

bigIndex $=$ findLargest $($&a$,$ start, end$)$;

swap $($&a$,$ end, bigIndex$)$; $/*$ swap largest with a$[$n$]*/$

$\}$

end $=$ end $-1$ ;

$\}$

$//$ The three functions called by above $C$ segments are shown next.

void findSmallest $($int $**a,$ int start, int end$)\{$

int smallestIndex;

int smallest $=a[$start$]$;

smallestIndex $=$ start;

for $(j=$ start; $j$ end; $j++)\{$

if $(a[j]$ smallest $)\{$

smallest $=a[j]$;

smallestIndex $=j$;

$\}$

$\}$

return smallestIndex;

$\}$

void findLargest $($int $*$a$,$ int start, int end$)\{$

int biggestIndex;

int largest start