1. True/False questions.(9pts) (1) Mergesort has time efficiency of e(n log n). (True, False) (2) Worst case of Quicksort is the case of input data is already sorted. (True, False) (3) In 2-3 Tree, search, insertion, and deletion are in ?(n). (True, False) 2. Which of the following binary trees are A VIL trees? (11 pts) 5 5 3 6 3 6 8 2 9 3