An algorithm takes an integer number n as an input and performs exactly $($n$)$ elementary bits operations before producing an output. Is this a polynomial time algorithm? Here $($n$)$ means Euler$$s totient function. You may use without proof that for all a in R$,$ a $>0$ one has