Your Friend claims that the maximum number of leaves ina a binary tree of height h, for h >=0, is 2^h. Confirm that this is indeed correct for small h by completing the following table.

h	Number of leaves counted in complete binary tree of height h	2^h
0
1
2
3