Euler's totient function (also know as Euler's phi function and denoted with the Greek letter φ) counts the positive integers up to a given integer n that are relatively prime to n. More formally, it counts the number of integers k in the range 1≤k≤n for which: gcd(n, k)=1.  The following are rules can be used for fast computation of phi, φ(j): if n is prime, then φ(n)=n-1   -- same as Fermat’s Little Theorem If gcd(n,m)=1, then φ(n*m)=φ(n)*φ(m) if p is prime, then φ(pn)=pn-pn-1.  Employing the rules above what is φ(17)?Single choice