1. Heapsort 2. Why study Heapsort? It is a well-known, traditional sorting algorithm you will be expected to know Heapsort isalwaysO(n log n) Quicksort is usually O(n log…
