Induction Problem

2. (20) As you remember, first step in any inductive proof is to show the base step. Here is an example showing if the base is not satisfied and checked, proof by induction can result is wrong results: (a) Using proof by induction, without checking the base case, show that n-n + i. (this is obviously a wrong equation, and the reason it is asked is to show you how important the base case is! (b) Give another example of a wrong equation which can be proven using induction if we ignore the base case. Show the proof by induction (w/o the base case)