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

1. In a maxheap, the root contains a search key greater than or equal to the search key in each of its children.

2. In a heap, the search keys of the children of a particular node have no relationship to each other.

3. The merge sort is more efficient than the heap sort in the worst case.

1. True
2. True
3. False