Question 1 (12 points; 6 points; 6 points) Consider the Bubble Sort algorithm: Input: An array A[1..n] of n elements. Output: A[1..n] sorted in non-decreasing order. 1. i1; sorted false 2. while in1 and not sorted 3. sorted true 4. for jn downto i+1 5. if A[j]