(IN JAVA) Do the following 5 methods without importing extra functions besides the default (i.e. System, Math)

METHOD 1: public static boolean isPrime(int i) This method should return true if and only if the input i is a positive prime number. A prime is a number which son y divs b a primes) METHOD 2: public static int numPrimes(int lower, int upper) This method will return the total number of primes in the range between lower and upper, including lower and upper themselves. Hint: it's possible to use isPrime(int i) as part of the computation. METHOD 3: public static int factorial(int n) Find the factorial of n, which is given by n! 1 2.(n-1)*n. The factorial of zero is a special case which is equal to 1 METHOD 4: public static double sumPower(int n, double p) Sums the series 1P+2P+n-1)PnP. METHOD 5: public static int boundedSum(int] list, int low, int high) Sums up the elements in list, but only including the elements x in list for which low Sx S high and e f owe ert nurnberso un lent considered