Apply quick sort on array [5, 4, 3, 1, 6, 7, 11, 9, 2, 10, 8]. Assuming the pivot value selected on the first pass of the sort is 8, what is the content of the array after the first pass of "Partition" around pivot completes?

please show work and write the answer on a piece of paper to answer the question

Given the following, write a line of code that will initialize p to point to the “7” inthe array).unsigned char x[] = {2, 3, 5, 7, 11, 13, 17};unsigned char *p, *q; If pointer q in the previous question points to some element of array x, whatexpression will return the index of the element pointed to? E.g., if q points to the 13in the above array, then your expression should return 5 In C Programming Please!

Given an array as follows5 4 9 10 2 8 1 3 7 6               Suppose we partition this array using quicksort's partition function and using 5 for the pivot. A) Draw the resulting array after the partition finishes.B) The following is an array which has just been partitioned by the first step of quicksort:3 0 2 4 5 8 7 6 9Give all the elements that could be the pivot? (There may be more than one possibility!)   PLEASE HELP WITH PART A AND B AND SHOW WORK!!