- if the outermost while loop of our implementation of inplace quick sort (line of code fragment were changed to use condition left right (rather than left <right)there would be flaw explain the flaw and give specific input sequence on which such an implementation fails - if the conditional at line of our inplace quick sort implementation of code fragment were changed to use condition left right (rather than left <right)there would be flaw explain the flaw and give specific input sequence on which such an implementation fails - following our analysis of randomized quick-sort in section show that the probability that given input element belongs to more than log subproblems in size group is at most / - of the npossible inputs to given comparison-based sorting algorithmwhat is the absolute maximum number of inputs that could be correctly sorted with just comparisonsr- jonathan has comparison-based sorting algorithm that sorts the first elements of sequence of size in (ntime give big-oh characterization of the biggest that can ber- is the bucket-sort algorithm in-placewhy or why notr- describe radix-sort method for lexicographically sorting sequence of triplets (klm)where kland are integers in the range [ ]for some > how could this scheme be extended to sequences of -tuples ( kd )where each ki is an integer in the range [ ] - suppose is sequence of valueseach equal to or how long will it take to sort with the merge-sort algorithmwhat about quick-sortr- suppose is sequence of valueseach equal to or how long will it take to sort stably with the bucket-sort algorithmr- given sequence of valueseach equal to or describe an in-place method for sorting - give an example input list that requires merge-sort and heap-sort to take ( log ntime to sortbut insertion-sort runs in (ntime what if you reverse this listr- what is the best algorithm for sorting each of the followinggeneral comparable objectslong character strings -bit integersdouble-precision floating-point numbersand bytesjustify your answer - show that the worst-case running time of quick-select on an -element sequence is (