Prove using Induction

4. Prove by induction that a perfect binary tree has 2h+11 nodes if the single root node is considered height h=0. Note also that a perfect binary tree has the two properties: (a) Every leaf is at the same depth/height. (b) Every non-leaf node has two children