You must use proof by induction, I am stuck on using the inductive hypothesis to get the conclusion.

7. In a pyramid scheme, the members of a company recruit more members into the company. A person that has already been recruited cannot be recruited again. We will also assume that no one leaves the company once they are recruited. A person's level in the company refers to how many recruitment steps they are away from the founder. The founder is at level 0. The people recruited by the founder are at level 1. The recruits of the people at level 1 are at level 2, and so on. The height of the pyramid scheme is the maximum level of anyone in the company. A company may enforce a recruitment limit which is an upper limit on the number of people any individual in the company can recruit. The recruitment limit is a non-negative integer. Prove by induction that a company with a recruitment limit of m and height h has at most mh people in the company who have yet to recruit anyone into the company