a.

Method definition to determine the given number is prime or not:

//Definition of method to determine the number is prime

public boolean prime( int n )

{

//Traverse till i reaches n

for ( int i = 2; i < n ; i++ )

//Check n%i equals to 0

if ( n % i == 0 )

//Return false

...

Prime number

Program Plan:

• Import required packages.
• Declare the class “PrimeNumber”.
• Define the main method.
  • Traverse the “for” loop to get the perfect number.
    • Call the method “prime()”.
      • Print the number.
  • Definition of method “prime()”.
    • Get the square root for “n” and store it in “max”.
    • Check the condition using “for” loop.
      • Check whether the “n” mod “i” equals to “0”.
        • Return the “false”.
        • • Else, return “true”.

Prime number

Program Plan:

• Import required packages.
• Declare the class “Limits”.
• Define the main method.
  • Traverse the “for” loop to get the perfect number.
    • Call the method “prime()”.
      • Print the number.
  • Definition of method “prime()”.
    • Check the condition using “for loop.
      • Check whether the “n” mod “i” equals to “0”.
        • Return the “false”.
        • • Else, return “true”.