1. Given 10 integers from 1 to 10, provide 5 permutations that each of them results in worst case running time for quick sort, which means each call to partition method can only reduce the array size by 1. 2| Suppose that we scan over items with keys equal to the partitioning item's key instead of stopping the scans when we encounter them. With this change, what is the running time for this Quick Sort implementation given input with all equal keys? 1. Given 10 integers from 1 to 10, provide 5 permutations that each of them results in worst case running time for quick sort, which means each call to partition method can only reduce the array size by 1. 2| Suppose that we scan over items with keys equal to the partitioning item's key instead of stopping the scans when we encounter them. With this change, what is the running time for this Quick Sort implementation given input with all equal keys