A palindromic prime number is a number that is both prime number and a palindrome number. For example, 131, 313, and 757 are palindromic prime numbers. Design (pseudocode and source code in JAVA or C#) a program to display the first 50 palindromic prime numbers, 10 per line separated by one space. The program defines the following methods:

Method isPalindome() to check if a number is palindrome or not.

Method isPrime() to check if a number is prime or not.

In the main method, use a loop structure to invokes these methods and print out the palindromic primes. Document your code and properly format the outputs as shown below.

Output format (each x is a palindromic prime number) Hint: Use modulus and division by 10 to reverse the number