Consider the following C code snippet.

void swap$($int $*$xp$,$ int $*$yp$)$

$\{$

int temp $=*$xp;

$*$xp $=*$yp;

$*$yp $=$ temp;

$\}$

int findMinimum$($int arr$[],$ int N$)$

$\{$

$//$ variable to store the index of minimum element

int min$\_$idx $=0$;

int min$\_$E $=$ arr$[$min$\_$idx$]$;

$//$ Traverse the given array

for $($int i $=1$; i $<$ N; i$++)\{$

$//$ If current element is smaller than min$\_$idx then update it

if $($arr$[$i$]<$ min$\_$E$)\{$

min$\_$idx $=$ i;

min$\_$E $=$ arr$[$min$\_$idx$]$;

$\}$

$\}$

return min$\_$idx;

$\}$

$/*$ Function to sort an array using selection sort$*/$

void selectionSort$($int arr$[],$ int n$)$

$\{$

int i$,$ min$\_$idx;

$//$ One by one move boundary of unsorted subarray

for $($i $=0$; i $<$ n$-1$; i$++)$

$\{$

$//$ Find the minimum element in unsorted array

min$\_$idx $=$ findMinimum$($&arr$[$i$],$ n$-$i$)$;

$//$ Swap the found minimum element with the first element

if$($min$\_$idx $!=0)$

swap$($&arr$[$min$\_$idx$+$i$],$ &arr$[$i$])$;

$\}$

$\}$

Implement the above C code snippet in RISC$-$V assembly language. Use s$0$ and s$1$ to hold the variable i$,$ and min$\_$idx in the function selectionSort. Be sure to handle the stack pointer appropriately. Clearly comment on your code.

Please note: no psuedo code allowed.