Write a bubble sorting algorithm that sorts a 10-element array called sortarray from smallest to largest. The array starts at address 0x400. The bubble sorting algorithm starts at element 0 and continues to the end of the array and swaps adjacent elements if one is greater than the other. For example, if sortarray[0] = 10 and sortarray[1] = 7, then it would swap the elements resulting in: sortarray[0] = 7 and sortarray[1] = 10. The algorithm then continues to compare the next two elements of the array: sortarray[1] and sortarray[2]. And so on, until it compares the last two elements of the array: sortarray[8] and sortarray[9]. The algorithm repeats this process until it processes the entire array without performing a swap. Sketch high-level code (C code) that uses a for loop to perform this algorithm. Name that program bubblesort.c. You need not test your C code, and you may use any text editor to write it. Then convert the high-level code to RISC-V assembly. Have your program hold any program variables (i.e., int x, etc.) in s0 – s11. Other values can be held in t0 – t6. Name your text file bubblesort.s. After you have written the assembly code, show the results of the code sorting the 10-element array {89, 63, -55, -107, 42, 98, -425, 203, 0, 303). Remember that sortarray starts at address 0x400.

Java-.Selection and insertion sort  3.a    Show steps of selection sort for the given array. You may need to add more rows to the table.   Selection Sort Initial value 3 2 7 5 4 8 9 10 1 Search 0 . . . end 3 2 7 5 4 8 9 10 1 Swap index 0                   Search 1 . . . end                   . . .                                                                                                                                                               3.b    Show steps of insertion sort for the given array. You may need to add more rows to the table.   Insertion Sort Initial value 3 2 7 5 4 8 9 10 1 , first item is sorted 3 2 7 5 4 8 9 10 1 , first 2 items are…

In c language  Consider this array     unsigned int data [ ] = { 0xA3A4A5A6, 0x12131415 }      write a for loop to print the array values in this order   0x1415  0x1213  0xA5A6 0xA3A4

Suppose an array has n elements. This _____ sorts to sort and array works as follows: Find the smallest element and place it in the first position. Then find the smallest of the remaining n-1 elements and place it in the second position. Repeat on n-2 elements, n-3 elements, ..., until the array is sorted.