Implement The following algorithms in the java file IntAlgo.java. Make sure all test cases work and try some test cases from homework $8.$

Algorithm $5\mathrm{.}1\mathrm{.}8.$ Returns $1$ if $p$ is prime, or the first divisor of $p$ if not.

Algorithm $5\mathrm{.}3\mathrm{.}3.$ An iterative version of the Euclidean algorithm.

Algorithm $5\mathrm{.}3\mathrm{.}9.$ A recursive version of the Euclidean algorithm.