Java Project

Problem A: Write a Java applicaton program to print (display) shown in the attachment please see the attachment: Problem B: Write another Java application program to find and display the first 8 Mersenne Prime numbers. A Mersenne Prime is a prime number that equals 2n - 1 (for an int n > 1, so start n at 2 in the loop). Stop the main loop when 8 are found (but allow this to work for less than 8 or more than 8 without changing anything other than the static CIS 35A-- Java Programming as a Second Language final variable for 8). Remember, a prime number is a number that has no divisors other than 1 and itself. You MUST include in this program: 1. for loops (one in main, one in the method). 2. static method to return a boolean value (true IF THE PARAMETER IS A PRIME NUMBER) by finding if there are any divisors between 2 and sqrt of the int parameter, inclusive (if none, it's prime). DON'T PRINT IN THIS METHOD! Hint: Use % (modulus) operator to determine if it's divisible (ask if you don't remember how)! % (modulus) operator to determine if a number is a divisor 3. static final (class-scope) variables for 2 and 8.