please help me do Q1and Q2

I will give a like

1. Show the operation of Quicksort (non-randomized) on the array [19,17,15,13,11,7,5]. You must show the following for each call made to Partition: a. The values of p and r b. The pivot chosen c. The state of array A after the call to Partition completes. For example, for the first call to Partition: 19]. p=1,r=7, pivot =5,A=[5,17,15,13,11,7, 2. Using your answer to problem 1 as a guide, find a tight (big- ) bound on the runtime of Insertion Sort, Merge Sort, and Quicksort for the case where the input array is already sorted in decreasing order. You must justify your answer for each algorithm. Don't just say "this is the worst case" and reference the lecture slides, explain in your own words why the runtime is what it is. Your explanation should include mathematical arguments about the number of loop iterations, recursive calls, swaps, etc