Selection Sort, Bubble Sort, Binary Search...etc Please answer all the questions & not only part of it:

Q4. (5 points) Answer the following questions. (a) What is the maximum number of comparisons for sorting an array of length n using the bubble sort algorithm and when does it happen (under what conditions)? Maximum Number of Comparisons for Bubble Sort When does it happen? (b) What is the average number of comparisons for sorting an array of length n using the insertion sort algorithm? Explain why. Average Number of Comparisons for Insertion Sort Why? (c) What is the minimum number of comparisons for sorting an array of length n using the selection sort algorithm and when does it happen (under what conditions)? Minimum Number of Comparisons for When does it happen? Selection Sort (d) What is the average number of comparisons for unsuccessful sequential search in a sorted array of length n? Explain why. Average Number of Comparisons for Unsuccessful Sequential Search Why? (e) What is the maximum number of comparisons for unsuccessful binary search in a sorted array of length n and when does it happen (under what conditions)? Maximum Number of Comparisons for Unsuccessful Binary Search When does it happen