Prove the following with a proof by induction on h:

h <= nI <= 2^(h) -1

Given that: Let T be a non-empty binary tree, and let n, nE, nI and h denote the number of nodes, number of external nodes, number of internal nodes, and height of T, respectively.