Question 2: Question 02 Suppose that P(n) is a propositional function. For which positive integers n, P(n) is true if we prove that: P(1) is True P(2) is True Yn e Z', P(n) P(n + 2) O All of the options. O P(4) Question 3: Question 03 Suppose that P(n) is a propositional function. For which positive integers n, P(n) is true if we prove that: P(1) is True (I + uz)d + (u)d'+Z) uA O P(6) O P(3) O P(2) O All of the options. O P(4)Question 4: Question 04 Suppose that P(n) is a propositional function. For which positive integers n, P(n) is true if we prove that: P(1) is True Yn ZT, P(|n/2|) P(n) O P(6) O P(4) O P(2) O All of the options. O P(3) Question 5: Question 05 Suppose that P(n) is a propositional function. For which positive integers n, P(n) is true if we prove that: P(6) is True WYn Z7, P(|n/2]|) P(n) O All of the options. O P(6) O P(2) O P(3) O P(4) Question 6: Question 06 Consider the following relation: t1 = 2 tn = ta-1 +1 forn > 1 Theorem: Vn E Zt, t, = 1 +n Which base case or cases will we want for a strong induction proof of this theorem? O Unable to determine base case from information given O n = 1 and n = 3 On = 2 O n = 1 and n = 2 On=1 x 0%