$(4$ points$)$ Using induction, prove that the number of nodes at level $k$ of a complete binary tree is exactly $2^k.$

$($Note: a complete binary tree is a binary tree where each level is saturated with nodes.$)$