show how it would look like after the second iteration for the first three algorithms listed below. Note that, one iteration for the Bubble, Selection, and Insertion sort means one round where one element is moved to its correct place. For the Quick sort, select first element of the list as pivot and sort all the elements until the pivot is exchanged one time only write the value after the exchange. Arr = 11 1 30 2 51 6 29 7 67 15 118 4 89 23 Bubble Sort Second Iteration Selection Sort Second Iteration Insertion Sort Second Iteration Quick Sort First Iteration Arr = 11 1 30 2 51 6 29 7 67 15 118 4 89 23.

1. show how it would look like after the second iteration for the first three algorithms listed below.
Note that, one iteration for the Bubble, Selection, and Insertion sort means one round where one
element is moved to its correct place. For the Quick sort, select first element of the list as pivot
and sort all the elements until the pivot is exchanged one time only write the value after the
exchange.
Arr =
11
1
30
2
51
6
29
7
67
15
118
4
89
23
Bubble Sort
Second Iteration

2. Selection Sort
Second Iteration
Insertion Sort
Second Iteration

3. Quick Sort
First Iteration
Arr =
11
1
30
2
51
6
29
7
67
15
118
4
89
23