$(30$ points$)$ Convert the following high$-$level code into RISC$-$V assembly code.

Assume that there is an array, int numbers $[5]=\{70,10,40,20,100\}.$ Register s$0$

contains numbers$$s base address.

int min $=$ numbers$[0]$;

int max $=$ numbers$[0]$;

int sum $=0$;

for $($int i $=0$; i $<5$; i$++)\{$

if $($numbers$[$i$]<$ min$)$

min $=$ numbers$[$i$]$;

if $($numbers$[$i$]>$ max$)$

max $=$ numbers$[$i$]$;

sum $+=$ numbers$[$i$]$;

$\}$