Suppose that T is a full Binary Tree where all leaves are at level p or higher. Prove by Mathematical Induction that for k = 0, 1, . , p the number...

Suppose that T is a full Binary Tree where all leaves are at level p or higher. Prove by Mathematical Induction that for k = 0, 1, … , p the number of vertices at level k is exactly 2k.                        

(note: each internal vertices has two vertices below it)