Q1) (15 pts) Given the following pseudo code of an algorithm to sort the integers in ascending order: (i) Identify the basic operation (ii) Would there be a best and worst case or not? Justify your answer. (iii) According to your answer for (ii), determine the number of times, the basic operation will be executed. Show all the work. ALGORITHM //Input: An array A[O... - 1] of orderable elements //Output: Array A[O..n - 1) sorted in nondecreasing order fori 0 ton - 2 do mini forji +1 to n - 1 do if A[j]