Problem #2 (5 points): Static and non-static methods, local variables, method parameters, operators, control flow statements 1. Download the runnable JAR file hw2p2.jar off the Canvas course site and run it to see how it works. How to run? See the problem #1 above. 2. Add a new package named hw2p2 to the project FirstName-LastName-HW2 (e.g., John-Smith- HW2). 3. Add a public class Prime with no main method to the hw2p2 package. a. Define a public, static, non-void method called isprime in the Prime class as follows: public static boolean isPrime(int n) { b. Write code for the isPrime method based on the following algorithmic description. Note that true means the number n is a prime number: i. If n = 2 and if n % i == 0, where i = 2 to n-1, return false ili. Otherwise, return true c. Define a public, non-static void method called sum Diff as follows: public void calcTotalAverage() { d. Write code for the sumDiff method based on the following algorithmic description: 1. The sum Diff calculates the total of prime numbers between 1 and 1000, the total of non-prime numbers between 1 and 1000, and the difference between the totals of prime numbers and non-prime numbers. II. The code for the sumDiff requires only local variables, calls to the IsPrime() method, and a few System.out.println() statements 4. Add a public launcher class called Prime Main with a main method. a. Write code for the main method. b. The main method must contain only two statements necessary for calling the sumDiff method. Make sure your program prints the right output. Write a java code for this output. Beginner level. The total of prime numbers between 1 and 1000 is 76127 The average of prime numbers between 1 and 100 is 453 The total of non-prime numbers between 1 and 1000 is 424373 The average of non-prime numbers between 1 and 1000 is 510, The different between non-prime total and prime total is 348246