Someone help please

Let A be an array of 5 integers, whose contents are as follows: 3, 2, 1, 5, 4 We will apply quick sort to sort this array. Show all of the element-wise comparisons made by the algorithm in the correct order. Here an element-wise comparison means the comparison of one element of the array with another element of the array or the key set in a particular step of the algorithm. Since the algorithm may move the elements of the array, you need to show the values of the elements being compared (rather than the form of A[i]). The rst element-wise comparison is 3 4? You should start with this element-wise comparison to write out all element-wise comparisons, one comparison per row.

Draw the portion of the decision tree for insertion sort on 5 elements a1,a2,a3,a4,a5 that contains the path from the root node to the permutation < a3,a2,a1,a5,a4 >.

Draw the portion of the decision tree for quicksort on 5 elements a1,a2,a3,a4,a5 that contains the path from the root node to the permutation < a3,a2,a1,a5,a4 >.

T(n) = 6T(n/2)+n3. Use the master method to solve T(n). You need to specify a, b, logb a, and decide the case. You also need to write the derived conclusion.