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$1$ and K$2$ of each size n:

i$.$ The binary search tree constructed for K$1$ is balanced.

ii$.$ The binary search tree constructed for K$2$ has height n $1.$