make the java code first then convert it to assembly code make sure it works on QTSpim.

Using the sample program as a guide, write an assembly program that sorts an array of numbers. Many different sorting algorithms exit such as bubble sort, selection sort, insertion sort, quick sort, merge sort etc. Choose a sorting algorithm and write assembly code to implement the chosen algorithm. Run and test your code. As part of the report, provide a high- level/pseudo code for your algorithm and its corresponding assembly code. - Use the following template for your assembly program: main: \# Your assembly code goes here. .data A: .word 1,9,3,7,5,5,7,3 B: .word 10,2,8,4,6,6,4,8 C