1. (20 pt.) Given the following recursive definition: Let S be the subset of Z Z defined as: Basis step: (0,0) E S Recursive step: if (a, b) E S, then: . (a+2,b+3) ES (a+3,b+2) ES Prove that a + b is divisible by 5 for any (a,b) = S using structural induction. Answer the following questions. a. (4 pt.) Complete the basis step of the proof by showing that the base case is true. b. (4 pt.) What is the inductive hypothesis? c. (4 pt.) What do you need to show in the inductive step of the proof? d. (8 pt.) Complete the inductive step of the proof. Activate