Question 2) a) (8 points) Explain how heap data structures are different from binary search trees (BSTs). Provide at least two main differences and explain each. b) (12 points) Apply the Heap Sort algorithm to sort the following list in ascending (nondecreasing) order. In addition to drawing the tree step by step, you should draw the array after each step. Show all your work. intlist[]={5,6,9,8,2,1}