Question 1 [20 Marks] For each of the following three sorting algorithms, describe its operation in detail, using diagrams, Java code, and/or pseudocode as you feel are appropriate. As part of your answer, for each one, demonstrate how it operates by showing all passes over the following array of integers: [3, 9, 1, 11, 5, 2, 8, 4]. (i) Selection Sort [4] (ii) Quick Sort [6] (iii) Insertion Sort [4] Derive an O-notation expression for the best-case complexity of (iv) Selection Sort [2] (v) Quick Sort [2] (vi) Insertion Sort [2]

It is not sufficient to write down the answers; you must explain your deviations.