(a) Use cases based on congruence modulo 3 and properties of congruence to prove that for each integer n, n³ equivalence n (mod 3).
(b) Explain why the result in Part (a) proves that for each integer n, 3 divides (n³ - n). Compare this to the proof of the same result in Proposition 3.27.