Prove that if a binary tree of height h has n $1$ vertices, then Ign $<$ h $+1.$ This result, together with Exercise $25,$ shows that the worst$-$case time to search in an n$-$vertex balanced binary search tree is $($gn$).$