Determine the efficiency class of the time complexity of the binary search tree algorithm in the worst-case for each of the following key sets K₁ and K₂ of each size n: i. The binary search tree constructed for K₁ is balanced. ii. The binary search tree constructed for K₂ has height n − 1.