Theorem Suppose a is an integer. If a is a multiple of 3, then a is a multiple of 3. Prove the theorem above by using a proof by contrapositive. Include in your proof, the following two cases: Case 1. a has the form 3k + 1, where k is an integer. Case 2. a has the form 3k + 2 , where k is an integer