solve all steps with explanations otherwise downvote

1. Apply quickselect to find the median of 8,15, 3, 19, 24, 32, 6. To find partition, use the Hoare's partitioning algorithm. First few steps are done. [15] Iteration 1: Pivot is 8 2 153 15 3 3 4 6 Initial (i, j) position. Pivot p - 8 Choose (i. j) step where A[i 2 p, Aj] p Swap Ali and Alij Choose (i, j) step where Ai] 2 p, AUl S p Swap Alj] and p 8 19 24 32 6 19 24 32 6 19 24 32 15 8 8 Iteration 2: Pivot is 1. Apply quickselect to find the median of 8,15, 3, 19, 24, 32, 6. To find partition, use the Hoare's partitioning algorithm. First few steps are done. [15] Iteration 1: Pivot is 8 2 153 15 3 3 4 6 Initial (i, j) position. Pivot p - 8 Choose (i. j) step where A[i 2 p, Aj] p Swap Ali and Alij Choose (i, j) step where Ai] 2 p, AUl S p Swap Alj] and p 8 19 24 32 6 19 24 32 6 19 24 32 15 8 8 Iteration 2: Pivot is