The height of a rooted tree is the length of the longest path from the root to any vertex. Find the maximum height a full binary tree having m terminal vertices, and draw the corresponding full binary tree.