9. Prove that a B-tree of degree $k$ and height $h$ has at least $2 \cdot \left\lceil \frac{k}{2} \right\rceil^{h-1}$ leaves, for $h \geq 1$. (15%)
9. Prove that a B-tree of degree $k$ and height $h$ has at least $2 \cdot \left\lceil \frac{k}{2} \right\rceil^{h-1}$ leaves, for $h \geq 1$. (15%)