please explain how you got their

Let's use numleaves(h) to refer to the number of leaves in a complete binary tree t of height h. In the space below, complete the proof by induction on the h that numLeaves(h) 2h, for all h0. 5. 5.a. Base case: when h is 0. We will show that numLeaves(0) indeed equals 20. (Writing 2 1 is definitely not enough...) 5.b. Inductive case: We begin by assuming that the claim is indeed true for all h = 0 , is 2, for all h o