Eulers totient function. Eulers totient function is an important function in number theory: (n) is defined as the number of positive integers less than or

Euler’s totient function. Euler’s totient function is an important function in number theory: φ(n) is defined as the number of positive integers less than or equal to n that are relatively prime with n (no factors in common with n other than 1). Write a class with a static method that takes an integer argument n and returns φ(n), and a main() that takes an integer command-line argument, calls the method with that argument, and prints the resulting value.