Select all correct answers!!

12. Consider the Tree Sort algorithm in which sorting is achieved by placing all elements to be sorted into a binary search tree and then taking the in-order traversal of the tree. Which of the following statements are true about Tree Sort? A. Tree Sort performs well on input that is already in nearly sorted order. B. The worst case time complexity of Tree Sort is (n log n). C. Using an AVL tree (i.e. "AVL Sort") instead of a regular binary search tree improves the worst D. E. case complexity. Tree Sort is stable, as long as the right policy is used for equally valued elements. None of the above are true