you can choose more than one answer.

Select the reasons, given the code implementation, why Bubble Sort generally executes longer than Selection Sort and why Selection Sort generally executes longer than Heap Sort? [n denotes the size of the list to be sorted. The Big-O notation [O(ellipses)] is described here but it is not necessary to know it to answer this question; simply check the code.] Bubble Sort generally performs many more swaps [O(n^2)] than Selection Sort n), but both generally perform the same number of comparisons [O(n^2)]. Bubble sort generally performs many more comparisons Con?)] than selection Sort [O(n log n)]. Heap sort uses extra memory (or space to improve its computation over Selection Sort and Bubble Sort. Heap Sort generally performs less number of comparisons [O(n log n)] than Selection sort and Bubble sort [O(n^2)]