$2-3$ tree Tree:

a$)$ is a perfectly balanced tree

b$)$ is a nearly balance tree

c$)$ has lower height than AVL tree.

d$)$ can store more than one keys in a node.

e$)$ a$,$ c$,$ and d

f$)$ all above