3) Use the Hoare partitioning algorithm on the following array. The randomly chosen pivot is 12 . Show the array after each swap. The space provided does not indicate the exact number of swaps needed. [10]

3) Use the Hoare partitioning algorithm on the following array. The randomly chosen pivot is 12 . Show the array after each swap. The space provided does not indicate the exact number of swaps needed. [10]