CS2233 Discrete Mathematical Structures Fall 2018 Homework 5 Due 11: 59pm Thursday Oct.18 Justify all answers in order to receive full credit. 1. Weak Induction in Steps (6 points) Let P(n) be the following statement: n2(n+1)2 The following sub-problems guide you through a proof by weak induction that P(n) holds for all n E Z+. (1) (1 points) What is the statement P(1)? Show that P(1) is true, which completes the base case. (2) (1 points) What is the inductive hypothesis? (3) (1 points) What do you need to prove in the inductive step? (4) (3 points) Complete the inductive step