Question2 Consider the algorithm MySolution below: Algorithm MySolution (A, n) Input: Array A of integer containing n elements Output: Array B of integer containing n elements 1. for i-0 to n-1 do 2. Resli)-0 3. end for 4. for i-0 to n-2 do 5. forj-i+1 to n-l do 6. 7. 8. 9. 10. end if 11. endfor 12. end for 13. for i 0 to n-1 do 14. B[Res li]l Ali] 15. end for 16. Return B if Ali)KAljl then Res lil-Res lil+1 else Reslil-Reslil+1 a) What is the big-O (O)) and big-Omega (2) time complexity for algorithm MySolution in terms of n? Show all necessary steps b) Trace (hand-run) MySolution for an array A (88, 12, 94, 17,2, 36, 69). What is the resulting B? c) What does MySolution do? Explain that clearly and briefly given any arbitrary array A of n integers? d) Can the runtime of MySolution be improved easily? Explain how (i.e. re-write another solution(s) that does exactly what MySolution is doing more efficiently)? Can the space complexity of MySolution be improved? Explain how? e)