Given a sequence of prime numbers $"41,83,37,59,47,67,23,53,31,73,$ please answer the following questions $($a$)$ Use the quick sort to sort this sequence in descending order $($need to write the result of each step$),($b$)$ Please briefly explain why the time complexity of this method in the worst case is $O(n^2)?($c$)$ Please briefly explain why the time complexity of this method in the best case is $O(nlo{g}_{2}n)?(6$ points, $2$ points for each question$)$