write an algoritm to determine whether an integer is prime of composite. The algorithm should return a $0$ if the in$-$teger is prime, a $1$ if the integer is composite and a $2$ if the integer is neither prime nor composite and a $3$ if the integer is less than $1.$ you may assume that the algorithm numberOfDivisors, defined in exercise $4,$ is available