1) Postage stamp problem. You will be given two integers p1 and p2 as a comment to this assignment. It has been shown that if p1 and p2 are relatively prime, then for any integer greater than x = p1*p2-p1-p2, x can be written as a sum of positive integer multiples of p1 and p2. That is to say, for any integer greater than this value of x, you could make the integer out of postage stamps of values p1 and p2. Your assignment is to use induction to prove this fact. Give a complete proof using good writing style. (FWIW, this is the|n=2 case of the so-called "coin problem"\" = 2) The general formula for the sum of an arithmetic series is the following: a + (a+d) + (a+2d) + (a+3d) + ... + (a+nd) = a(n+1) + d(n(n+1)/2) You will be given values of a and d to give a direct proof of this formula using induction. You should ot/ copy the proof for the general case. Rather, you will follow the induction proof like we did in class for the summation (1+2+...+n) but use the sequence you are given (the above sequence but with your values of a and d plugged in)