$[5$pts$]$ Consider a tree $T$ storing $100,000$ entries. What is the worst$-$case height of $T$ in the following cases?

a$.T$ is a binary search tree.

b$.T$ is an AVL tree.

c$.T$ is a splay tree.