C Language Code: void main () { int A [10] = { -5, 6, 20, -83, 99, 19, 100, 0, -46, 25}; int Z= order (A, 9); } int order (int array_in [ ], int last) { int count = 0; for (int i= 0; i array_in[i+1])...

That's a Computer organization

Extracted text: C Language Code: void main () { int A [10] = { -5, 6, 20, -83, 99, 19, 100, 0, -46, 25}; int Z= order (A, 9); } int order (int array_in [ ], int last) { int count = 0; for (int i= 0; i < last;="" i++)="" if="" (array_in[i]=""> array_in[i+1]) { temp = array_in[i]; array_in[i] = array_in[i+1]; array_in[i+1] = temp; count++; if (last == 1) return count; else return (count + order (array_in, last – 1)); }


Extracted text: Use "venus" online simulator to write and execute the code below using RISC-V Assembly language. The code consists of two procedures: “main" and "order". Notice that "order" is a recursive (i.e. non-leaf) procedure responsible for sorting an input array of 10 integers in ascending fashion and returning the total number of swap operations performed. The "order" procedure must be implemented as a non-leaf procedure. In the "main" procedure, we call the "order" procedure with the starting address of array "A" in the global pointer register (i.e. gp or x3) and the variable "last" in register x12. The returned value of the procedure should be mapped to register x10. Assume that variable "Z" in the "main" procedure is mapped to register x20 and the variables inside the "order" procedure can be mapped to temporary registers. The returned value of the example array given in the code is 19. But you need to test your code with different array values to make sure that it is working correctly. After testing, save your Assembly code in a text file named "Student1 ID Student2ID.txt". For example, if the ID of Student1 is 0000 and the ID of Student2 is 1111, then the file name should be "0000 1111.txt".