(b) We say that a number N is a rainbow number if every digit from {0, 1, . . . 9} shows up exactly once in N; for example, 1234567890 and 1029384756 are both rainbow numbers. Take any two integer rainbow numbers N, M. Prove that N M 0 mod 9.