Let f be a multiplicative function satisfying f(d) = n/(n), where the sum is taken over all positive divisors of n, and is Euler's totient function. Use the Mobius inversion formula to prove that f(n) = 2(n)/(n) .