Need solution part wise ASAP!

Game Proof - Base Cases You will now use strong induction to prove the conjecture you have written Q2-Part1. To justify some of your steps in the proof, you can use the game rules that you have formulized in the 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. Please write the base cases of your proof in the attached handout: Lab4Q2Part2.docx Lab4Q2Part2.pdf Problem Statement The problem statement has the form nN+P(n) Please copy here the predicate function P(n) you wrote in the last page. Base Cases (9 marks) Prove your base cases here Game Proof - Base Cases You will now use strong induction to prove the conjecture you have written Q2-Part1. To justify some of your steps in the proof, you can use the game rules that you have formulized in the 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. Please write the base cases of your proof in the attached handout: Lab4Q2Part2.docx Lab4Q2Part2.pdf Problem Statement The problem statement has the form nN+P(n) Please copy here the predicate function P(n) you wrote in the last page. Base Cases (9 marks) Prove your base cases here