$(10$ points$)$ Problem $3$: Sorting Algorithms. You are given the following array con$-$

taining a sequence of distinct integers:

$A=[3,9,1,14,17,24,22,19]$

$(5$ points$)$ Using Insertion sort, show the contents of the array after every pass.

$(3$ points$)$ Using Quicksort, show the contents of the left and right sub$-$arrays after the

first pivot is chosen to be $A[4]=17.$

$(2$ points$)$ Using Mergesort, determine the height of the Merge sort tree $($you do not

need to run the full algorithm for this$).$