5) You must use induction for your proofs of the following statements. Be sure to clearly state your hypothesis (what you're trying to prove), and show the base step and the inductive step in your proofs. a) Use induction to prove: The number of subsets of ,2 n that have an odd number of elements in them is 2- Here's a hint that may help: The total number of subsets of (1, 2, ..., n) is 2", since for any subset, each of the n different values is either in or out. b) Use induction to prove: If a Tree has n vertices, then it has exactly n-1 edges