Hello,this is discrete math. I do not know how to prove this problem. There is no more information.Please teach me to solve this problem how to access it.

suppose we define good points using the following inductive definition: Foundation: (1 , 0) is a good point Constructor: If (a, b) and (c, d) are good points, then so are (b, a + 2) and (a+ c, b+ d+1) Use structural induction to prove that a + b is odd for every good point (a, b). Part a) (1 pt) List the good points that can be created with one application of the constructor rule. P(n ) obtained by A application which construct Part b) (1 pt) What is P(m) (i.e., predicate you are proving holds true for all natural numbers n)? pin) is Clot is good point . ! Part c) (2 pts) Base case: p(k ) true hold Part d) (6 's) Inductive step: n - IN