Would anyone please show me a step-by-step solution and explanation for this statement? It's a "Discrete Math" problem and here's the problem:

"Let P(n} be the statement that a postage of n cents can be formed using just 5-cent and 7-cent stamps." Use strong mathematical induction to prove that P(n) is true for n a 24. (NOTE: You can't use Proposition 5.3.1 to complete the proof. Please remember that you must prove the statement using strong mathematical induction) Proposition 5.3.1 For every integer n 2 8, 12 can be obtained using 3526 and 5 coins. Proof (by mathematical induction): Let the property P(n) be the sentence n can be obtained using 3 and 595 coins. (. P(n) Show that P(8) is true: Note To write P(8), just P(8) is true because 89', can be obtained using one 3 coin and one 5;: coin. :25: :32 2nd replace Show that for every integer k 2 8, if P(k) is true then P(k + 1) is also true: I [Suppose that P(k) is true for a particular but arbitrarily chosen integer k 2 8. That is.'] Suppose that k is any integer with k 2 8 such that Note To write P(k), just k can be obtained using 3 and 59: coins.