a) What is the big-O (O(n)) and big-Omega ((n)) time complexity for algorithm M. Algorithm below in terms of n? Show all necessary steps. b) Trace (hand-run) MyAlgorithm for an array A = (4,105, 1,3). 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) What type of recursion is used in MyAlgorithm? Is MyAlgorthm tail-recursive