solve

Multiple Choice 1 point In the divide-and-conquer algorithm for the maximum contiguous sum, which of the following could not be true. C) lhmax == lmax (_) lhmax lmax (_) smax = lhmax + rhmax Multiple Choice 1 point Which of the following lists proves that selection sort is unstable? [3,5,9, 4,2] [7,7',4,8,]] Cy 5 33.0'8] () None of these will prove it. Multiple Choice 1 point Which of the following has the fastest asymptotic time complexity if the list is already sorted? (_) Insertion sort (_) All options are equally good. () Bubble sort () Selection sort Multiple Choice 1 point For a list of length 5, how many inversions could there be? () Between O and 10 inclusive. () Between 10 and 20 inclusive. ( ) Between 0 and 20 inclusive. a (_) Between 0 and 15 inclusive