You are required to write the following functions using: 1) MIPS ASSMBLY and 2) x86 ASSEMBLY Employees are asked to stand in non-decreasing order of heights for an annual photo. Write an assembly program using Bubble Sort to output the minimum number of employees that must move for all employees to be standing in non-decreasing order of height. Note: You may assume no duplicates in the array. Hint: You should use this pseudocode as a helper for your implementation void bubbleSort (int arr[], int n) { int i, j; for (i = 0; i arr[j+1]) swap (&arril, &arr[j+1]); Sample test case 1: Input: heights = [1,1,4,2,1,3] Output: 4 Explanation: Current array: [1,1,4,2,1,3] Target array: [1,1,1,2,3,4] Sample test case 2: Input: heights = [5,1,2,3,4] Output: 4 Sample test case 3: Input: heights = [1,2,3,4,5) Output: 0