Answer the following statements true (T) or false (F)

1) One of the benefits of implementing a heap with links is that a node does not need a link to its parent.
2) In a maxheap, the largest element is always the root.
3) Whenever a new element is added to a maxheap, it always becomes the root.
4) A heap sort sorts elements by constructing a heap out of them, and then removing them one at a time from the root.
5) Implementing a heap using an array simplifies the management of the last added node in the heap.

1) F
2) T
3) F
4) T
5) T