10 points) Suppose we have a pivot-finding method that uses theelement at the middle index of an array as the pivot, and that werun QuickSort using this pivot-finding algorithm. (a) (5 points)Give a general description of an array of length n that would causethe running time of this version of QuickSort to be the worstpossible, and explain why your example is correct. (By a “generaldescription”, I mean that your description should cover allpossible values of n, such as “a list of the numbers from 1 to n inascending order”). (b) (5 points) Explain why, in the worst case,this pivot-finding method
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured