a) What is the Big-O (O(n)) and Big-Omega (O(n)) time complexity for algorithm MyAlgorithm below in terms of n? Show all necessary steps. b) Trace (hand-run) MyAlgorithm for an array A=(4,11,5,3,2). What is the resulting A? c) What does MyAlgorithm do? What can be asserted about its result given any arbitrary array A of n integers? d) Can the runtime of MyAlgorithm be improved easily? how? e) Write the algorithm using actual Java code, insert any additional lines of code for the sole purpose of finding out the number of executions, then run with different initial values of the array including the one given above. Do the results correspond to your above estimate of Big-O? If no, explain clearly the reasons behind this mismatch! Provide the Java code, and the sample outputs as part of your answers. Algorithm MyAlgorithm(A, n) Input: Array of integer containing n elements Output: Possibly modified Array A done true 10 while j A[j+ 1] then swap(A[i], A[ +1]) done:= false 1+1+1 end while jen-1 while j> 1 do if A[] <>