Please read the questions very carefully and then answer. Show each step.

for this question show all the steps in the table.

ist iteration and then the array :| 8 | 10| 7| 6| 4| : then show swaps

2nd iteration and then then new array in table and show swaps and so on.
keep everything in a box and show the steps.
Please answer must be correct: and include all the parts mentioned.

for second question: show which one of these three is applied and why and how?

1. T(n) {Θ(n^d) if a 2. T(n) {Θ(n^d log n) if a=b^d
3. T(n) {Θ(n^(log_b(a))

Transcribed Image Text:

1. Apply the QuickSelect algorithm on the following array to find its 3rd order statistic, i.e., the median of the array. Please make sure that your solution, similar to the example you saw in the lectures, explicitly shows (1) the changes of all pointers at each iteration, (2) the iteration number of the LomutoPartition and QuickSelect algorithms, (3) the swaps made at each step (if any), (4) the explanation as to what subarray is processed next and why. A = [8, 10,7,6,4] 1. Apply the QuickSelect algorithm on the following array to find its 3rd order statistic, i.e., the median of the array. Please make sure that your solution, similar to the example you saw in the lectures, explicitly shows (1) the changes of all pointers at each iteration, (2) the iteration number of the LomutoPartition and QuickSelect algorithms, (3) the swaps made at each step (if any), (4) the explanation as to what subarray is processed next and why. A = [8, 10,7,6,4]