Let a be an array of size n indexed by 0, 1, ... n -1. Now consider Bubble sort pseudo code. for j in the range [0, n-1] for i in the range [0, n-j-2] if (a[i] > a[i + 1] swap (a[i], a[i + 1]) Use mathematical induction to show: At the start of jth iteration of outer loop the following conditions hold: a[n - j] lessthanorequalto a[n -j + l] lessthanorequalto a[n - 1] a[n - j], a[n - j + 1], ... a[n - 1] are the j largest elements of the array