A binary tree is full if every non-leaf node has exactly two children. For context, a binary tree of height h can have at most 2^h+1 1 nodes and at most 2^hleaves, and that it achieves these maxima when it is complete, meaning that it is full and all leaves are at the same distance from the root. Find (h), the minimum number of leaves that a full binary tree of height h can have, andprove your answer using ordinary induction on h. Note that tree of height of 0 is a single (leaf) node. Hint 1: try a few simple cases (h = 0, 1, 2, 3, . . . ) and see if you can guess what (h) is.