Write a method totient that returns . By convention, . For , you must use Euler's formula for . Your solution will not receive full credit if you count the number of integers below n that are relatively prime with n by "brute force". Call the smallestPrimeFactor method from Part (a). Assume that it works correctly, regardless of what you wrote in Part (a). Solutions that include code that can be replaced by a call to smallestPrimeFactor will not receive full credit. Complete the method totient below. Question 1(b) /** Returns the value of Euler's totient function of n. * Precondition: n >= 1 */ public static int totient(int n)