You are given an array of twenty $32-$bit different positive integers $($ARR$),$ and another array

$($COUNT$)$ of twenty elements each has the number of cells that are greater than the correponding

element of array ARR. You are asked to write a RISC$-$V assembly code that sorts array ARR in

array RESULT, in an descending order, in $O(n)$ complexity. You can only use the implemented

assembly instructions on architecture from HW$2.$

You should initialize arrays ARR, COUNT and RESULT accordingly and use it in your tests.

Having the machine code for your assembly code load it to architecture from Homework $2,$ run it

and show your results.

Test:

Result:

Note: Turn in your answers as $[$StudentNo$].$zip file structured as follows with a maximum of $5-$

minute video $([$StudentNo$].$mkv$)$ explaining your design and testbench $([$StudentNo$].$v$,$

$[$StudentNo$]\_$tb$.$v$,[$StudentNo$].$vcd$)$ results. Grading: