Program: Write a complete java program that is made of three methods main(), primeSum(), and bePrime(). The skeleton of these methods are shown below. // Judge if n is a prime number and return the Boolean result to caller bool bePrime(int n) { Use a loop, better with a logical variable. } //return the sum of all prime numbers less than m int primeSum(int m) { Il for loop to traverse all integers from 2 to m // Call be Prime() in the loop body, preferably using an if statement } int main() { /call primeSumo The main function should do following. 1) Input: Read an integer from the user console with proper prompt 2) Processing: Call primeSum() with an assignment statement and save the result in a variable. 3) Output: Print result with proper prompt