simpley convert the code below to assembly languageYour proof-of-study task is to hand-compile the code below into an assembly l
anguage function (a procedure), then place it in the provided .asm file, test it, and turn it in. Your function must adhere to the procedure calling conventions covered in class. You must also use specific registers when storing local variables, see below.Before you start: You may use my tests -- I've set them up to make it easy for you to test your code, and I have examples in the tests! :) Here they are:Proof-of-Study #4.asmHere is a recursive sorting algorithm that you will convert into assembly:void sort (int[] data, int lowIndex, int highIndex){ print ("Entering sort: ") print (lowIndex) print (" ") print (highIndex) print ("\n") if (lowIndex >= highIndex) print ("Leaving sort: ") print (lowIndex) print (" ") print (highIndex) print ("\n") return tempIndex = lowIndex centerIndex = lowIndex centerValue = data[highIndex] while (tempIndex < highIndex) tempValue = data[tempIndex] if (tempValue < centerValue) data[tempIndex] = data[centerIndex] data[centerIndex] = tempValue centerIndex = centerIndex + 1 tempIndex = tempIndex + 1 data[highIndex] = data[centerIndex] data[centerIndex] = centerValue sort (data, centerIndex+1, highIndex) sort (data, lowIndex, centerIndex-1) print ("Leaving sort: ") print (lowIndex) print (" ") print (highIndex) print ("\n") return}Note that the code looks similar to Java, C, or many other languages. It has variables (assumed to be integers or arrays), a loop, and 'if' statements. The loop and 'if' statements use indentation to show scope.When converting this algorithm, use only these registers for variables:Variable Register Notesdata $s1 Array address, it arrives in $a0 but your code will copy $a0 to $s1 and use $s1 insteadlowIndex $s2 integer, it arrives in $a1 but your code will copy $a1 to $s2 and use $s2 insteadhighIndex $s3 integer, it arrives in $a2 but your code will copy $a2 to $s3 and use $s3 insteadtempValue $t0 integertempIndex $t1 integercenterValue $t2 integercenterIndex $t3 integerWhen needed, you can use $t4-$t9 for additional temporary computations (addresses, etc.), but not for program variables. You may use pseudoinstructions.You will need to add code to the function to properly create a stack frame and to preserve registers appropriately. Follow the convention covered in class (required). Clearly comment your code. You may write the assembly code for your function separately, or you may write it as part of this test program (easier):Do not optimize your program. Each C/Java statement should be independently translated to assembly. Don't avoid writing code because you want to reuse a previous temporary value - always write the complete code for each statement. (You can verify correctness much faster by doing it this way.)After you convert the statements, add the code to create the stack frame and do preservation of registers.The code is recursive. Be careful to preserve the needed temporary variable(s) just before you make the first function call, and restore it/them when the function call completes.If you're curious, note that I adapted a quicksort algorithm to be easy to code in assembly.Do not add sorting code (or other critical statements) to 'main' because it won't be in our version of main. You can change your main as needed for testing (but remember that we will not use your 'main' function).Your sort procedure should be contiguous statements. Don't embed other functions within your sort function. We'll only copy your sort function into our test code, and it needs to be easy for us to extract it.
