4.3/(5 pts) You are given the following array to be sorted (in increasing order) using quick sort. Array to be sorted: I 9 8 1 3 12 4 1714 5 Show what your array looks like after 1 pass of the quick sort principle. 4.4/(5 pts) Provide an example of an array of 5 Integers, to be sorted in increasing order, and for which the insertion sort will run the most efficiently. Justify your choice. Justification: 4.5/(5 pts) Provide an example of an array of 5 integers, to be sorted in increasing order, and for which the quick sort (where the pivot is chosen to be the first element of the array) will run very poorly. Justify your choice. Justification