Consider the following code. for (int i = 1; i a[i+l]) swap (a[i], a[i+l]); Show by induction that the above loop has the following invariant: " a[i] is the maximum among a[l], a[2], a[i]<>