Assume that arrX array is already defined and allocated in memory, its base address and its number of elements are already stored in $a2 and $a3 correspondingly. Answer each of the next questions as required. Questions are independent. arrx: .word Ox99, 0x20,0x73, 0x40,0x50,0x 69, Please write question numbers and answer parts in this question in order. Q1) Write no more than 7 MIPS instructions to calculate $vo: if (arrx[2] >= arrx [20] ) $v0 = arrx [2] -arrx [20]; else $v0 = arrx [20] - arrx [2]; Q2) Write no more than 12 MIPS instructions that arranges in ascending order the neighboring elements in every pair of arrX. For example, if arrX={5,2,8,20,30,15...,9,7}, then after executing your code arrX becomes {2,5,8,20,15,30,...,7,9)