next. Consider the algorithm shownlor Mystery (A[n])// Array A[1..n] of n integers n; while i flag for a) (7 points) Assume you are given an array A which consists of n integers. Give the best- and worst-case complexity of the algorithm as a function of the size of the input n. Justify your answer. b) (3 points) Show examples of input arrays that achieve the best and worst time 2 3 4 5 if (A[j-1] > A[j]) { 6o elgoed swap A[j-1] and A[j] flag False; 7 8 9 9 1 do True; vino be 2 to i 10 11 ) if (flag return i=i-1; end-while True) are vine