Problem 3: Strong induction and quantifiers (10 pts) In class and discussion we have solved mumerous problems such as the following: prove, using strong induction on n that the sequence a which is recursively defined as follows: an-1+ 2 a-, n22 has the closed-form formla a-3-2+2(-1)" reference, as we have done many times This Proposition on n can then be encoded as P(n) for ease of We are interested in using the principle of strong mathematical induction to prove P(n) Vn EN. At least one of the following quantified statements express(es) both the requirements and the result of applying this principle. Say which one(s) you think it (they) s (are), and, for all others, briefly state the reason for which you did not select it Recall that, in our class, EN. Problem 3: Strong induction and quantifiers (10 pts) In class and discussion we have solved mumerous problems such as the following: prove, using strong induction on n that the sequence a which is recursively defined as follows: an-1+ 2 a-, n22 has the closed-form formla a-3-2+2(-1)" reference, as we have done many times This Proposition on n can then be encoded as P(n) for ease of We are interested in using the principle of strong mathematical induction to prove P(n) Vn EN. At least one of the following quantified statements express(es) both the requirements and the result of applying this principle. Say which one(s) you think it (they) s (are), and, for all others, briefly state the reason for which you did not select it Recall that, in our class, EN