Vrite RISC-V assembly code for bubble sort (without function calling). ssume that arr[5] ={6,1,3,2,7}; starting at memory address 010000000. seudocode for bubble sort rocedure bubbleSort( list : array of items) loop = list.count; for i=0 to loop-1 do: swapped = false for j=0 to loop-1 do: /* compare the adjacent elements */ if list[j] > list[j+1] then 1 * swap them */ swap( list[j], list[j+1]) swapped = true end if end for / *if no number was swapped that means array is sorted now, break the loop. */ if(not swapped) then break end if end for nd procedure return list