A The Quickselect is a algorithm. Divide and conquer decrease by a variable size decrease by a constant decrease by a constant factor B The sum j=14i=253 is 60 37 48 27 C Johnson and Trotter algorithm generates all permutations less than N before generating the permutation of N objects. True False D Select all true statements. Negative points for incorrect selections Lomuto's algorithm is utilized in Quick select algorithm Lomuto's algorithm finds permutation of N objects Lomuto's algorithms is an example of divide and conquer algorithm design startegy Lomuto's algorithm is a partitioning algorithm E Select all algorithm that use divide and conquer design strategy. Incorrect sections receive negative points. Peasant Russian multiplication finding closed pair of points from a collection of points in the plane Strassen's matrix multiplication Fake coin selection F Consider quick select algorithm and search for the kth smallest element in an array of integers. Suppose the partition algorithm returns the value s=k. The next action should be continue quick select on the right portion of the array to the right of index s If s=k, then there is no kth smallest element. return A[s] as the kth smallest element Continue quick select on the left portion of the array to the left of index s