Prove that the maximum number of vertices at level k of a binary tree is 2k and that a tree with that many vertices at level k must have 2k+1−1 vertices.