1 What is the advantage of using a list over using an array to implement a heap? 2 The heap sort uses a heap to sort a list of items. The strategy of this sort is to add the items in the list to a...

1 What is the advantage of using a list over using an array to implement a heap?

2 The heap sort uses a heap to sort a list of items. The strategy of this sort is to add the items in the list to a heap, and then remove them all from the heap as they are transferred back to the list. What is the run time and memory complexity of the heap sort?