comparison-based algorithm used to sort n elements require at least Ω(nlogn) comparisons in the worst case. Based on this information, what would be the complexity of constructing an n-node binary search tree, and why? (Hint: Start by establishing a connection between BSTs and sorting algorithms.)