Answers must be correct. Or else it will be flagged. All sub-parts need to be answered with step by step process showing all work and reasoning.

YOU MUST PROVIDE ALL ANSWERS AS PER THE QUESTIONS.

DON'T PROVIDE WRONG ANSWERS AND DON'T ANSWER IF YOU DON'T WANT TO ANSWER ALL SUB-PARTS. INCOMPLETE ANSWERS WILL BE FLAGGED

DISCRETE STRUCTURES

Answers must be correct. Or else it will be flagged. All sub-parts need to be answered with step by step process showing all work and reasoning.

YOU MUST PROVIDE ALL ANSWERS AS PER THE QUESTIONS.

DON'T PROVIDE WRONG ANSWERS AND DON'T ANSWER IF YOU DON'T WANT TO ANSWER ALL SUB-PARTS. INCOMPLETE ANSWERS WILL BE FLAGGED

DISCRETE STRUCTURES

Recall that N 0, 1,2,3,...). Moreover, if a E N we write Na for the set (EEN> a). 1.A. Prove the following instance of the binomial theorem: r2 rh. k-o Hint: recall Pascal's identity)+() 7L 1.B. Suppose that stamps are worth either 5 or 8 Prove that if n always mail something that costs n to send Hint: use strong induction and base cases for 28,... ,32. 28 then you can