Prove this modular arithmetic property: [(a mod n) * (b mod n)] mod n = (a * b) mod n; where a and b are integers, n is a positive integer, and * is the multiplication operation. Hint: one way is to leverage fact that we can represent any nonnegative integer using the integer division algorithm: divide nonnegative integer a (dividend) by positive integer n (divisor) get integer q (quotient) and integer r (remainder) such that: a=an+r where 0