Need solution part wise ASAP!

Game Proof - Inductive Step You will now finish your proof. To justify some of your steps in the proof, you can use the game rules that you have formulized in Part 1, and some of the properties of mod described in the Properties section of Wikipedia's page on modulo arithmetic, particularly the identity and distributive properties. The inductive step in this proof is not trivial, and this is why it is worth so many marks. A very thorough proof takes about two pages. You should expect that your proof will take at least one and a half. Please write the inductive step of your proof in the attached handout, and upload all its pages in this Crowdmark question: Lab4Q2Part3.docx Lab4Q2Part3.pdf Problem Statement The problem statement has the form nN+P(n) Please copy here the predicate function P(n) you wrote in Q2-Part 1. Inductive Step a) Inductive step setup. - (2 marks) State the assumption in the inductive step and identify the inductive hypothesis. - (1 marks) State what you will be proving in the inductive step. b) Remainder of Inductive step ( 18 marks). Finish your proof here. Be sure to justify every step, particularly why the inductive hypothesis and recursive definitions can be applied, and when they are applied. Note that this proof involves division into cases. When some of the cases have very similar structures, you can save yourself some work by doing the first case thoroughly and then summarizing the other cases explaining the similarities and differences. This proof is not simple and this is why it is worth so many marks. A very thorough proof takes about two pages. You should expect that your proof will take at least one and a half