For how many primes p, there exits unique integers r and s such that for every integer x x^{3} \minus{} x \plus{} 2\equiv \left(x \minus{} r\right)^{2} \left(x \minus{} s\right)\pmod p?<spanclass=′latex−bold′>(A)</span> 0<spanclass=′latex−bold′>(B)</span> 1<spanclass=′latex−bold′>(C)</span> 2<spanclass=′latex−bold′>(D)</span> 3<spanclass=′latex−bold′>(E)</span> None modular arithmeticalgebrapolynomialVieta