$4\mathrm{.}20$ Keys $1,2,...,2$k $1$ are inserted in order into an initially empty AVL tree. Prove that the resulting tree is perfectly balanced.