Let G_n be defined recursively as G_?1=0 and G₀=1 and for n?1, G_n=G_n?1+G_n?2+1.

Prove that the height-balanced criteria is critical in the previous claim. In other words, consider the following claim: for any binary tree T, nodes(T)?G_h(T). Prove that this claim is false.