5:27 x[i]): x[i-1], x[i] = x[i], x[i-1] return x, number_of_steps When doing the following run: >>> a = [5, 4, 2, 1, 10, 3, 7, 6, 70, 8] >>> a, steps = bubbleSort(a) >>> a [1, 2, 3, 4, 5, 6, 7, 8, 10, 70] > > > steps 81 Update the bubbleSort function so that it is optimized and runs in 30 steps for the above provided example 5:27 x[i]): x[i-1], x[i] = x[i], x[i-1] return x, number_of_steps When doing the following run: >>> a = [5, 4, 2, 1, 10, 3, 7, 6, 70, 8] >>> a, steps = bubbleSort(a) >>> a [1, 2, 3, 4, 5, 6, 7, 8, 10, 70] > > > steps 81 Update the bubbleSort function so that it is optimized and runs in 30 steps for the above provided example