$2.$ Consider the following array of values:

a$.$ Use the number $34$ to create a partitioning for quick sort.

$[5$ marks$]$

b$.$ Using the bubble sort algorithm to sort the above numbers. Show each pass of the algorithm and the state of the array after each pass until the array is sorted and write the dime complexity of the algorithm.

$[5$ marks$]$

c$.$ Using the Merge sert algorithm to sort the above numbers. Show each pass of the algorichm and the stase of the array after each pass until the array is sorted and write the time complexity of the algorithm.

$[5$ marks$]$

d$.$ Use the insertion sort olgorithm to sort the above numbers. Show each pass of the algorithm and the state of the array after each pass untill the array is sorted and write the time complexity of the algorithm.