Question 9: In Lecture 5, we introduce the MISP implementation for bubble sort. Please convert the following bubble sort code into MISP implementation, including the complete implementation of swap function. Note: please use $a0 and Sal for swap(). void sort (int v[], int n) { int i, j; for (i = 0; i = 0 && v[j] > v[j + 1]; j 1) { swap(v,j); } } } v in $a0, n in $a1, i in $50, j in $s 1 -= 3 Question 10: Represent the following numbers into a binary single precision floating-point number. Your answer should be 32 bits long ordered by 1 sign bit, 8 exponent bits, and fraction bits. A) -0.85 B) 1.1 C) 0.75