Write a method called isPrime which returns true if the given integer is prime and false otherwise. This is similar to the Chapter 11 problem, but this time write your method using recursion.
In your main method, include a Scanner so the user can check as many numbers as they want until they enter -1.
Note: There are more complex solutions, but this is the fastest one within the scope of this chapter.
Code a recursive merge sort algorithm that only uses the given parameter array, and creates no other array in the process.