I am having some trouble figure out the steps to prove these two problems using induction.

In the two questions F(n) is the product of the first n odd positive integers. And G(n) is the product of the first n even positive integer. I'm suppose to show the four steps of the inductive proof and justify my changes of inequalities by each rule.

1. Use induction to show that F(n)G(n) = (2n)! n >=1

2. Use induction to show that F(n) < G(n) for all n>=1