Write a Java code

A semi$-$prime number is a natural number that is the product of two $($possibly equal$)$ prime

numbers. In other words, a semi$-$prime number has two $($possibly equal$)$ prime factors.

Examples: $4,6,9,10,14,15,21,22,$dots

Write a method that

has the header public static boolean isSemiPrime$($int number$),$

checks whether a number given as an input argument is semi$-$prime or not,

and returns true if the number is semi$-$prime; false otherwise.

Write a program that

finds all semi$-$prime numbers that are less than $50$ by using the isSemiPrime method described above,

and prints these numbers on the console as shown in the console output given below.