Let \(\phi(n)\) be Euler’s function. Namely \(\phi(n)\) counts how many integers from \(1\) to \(n\) inclusive are coprime with \(n\). For two natural numbers \(m\), \(n\) such that \(\gcd(m,n)=1\), prove that \(\phi(mn) = \phi(m)\phi(n)\).