his question has three parts and tests mathematical induction. Give a recursive definition of the set P of all positive integers greater than 3, formulate the appropriate induction principle, and then use mathematical induction to prove that (i) (i) 2< k! for all positive integers n > 3. + Question 3 Acuivate Windows Construct a regular expression that defines the language of all words that do NOT end and begin with the same letter. The two shortest words in the language are ab and ba. ito activate Windows.