The prime factorization of a number is the unique list of prime numbers that, when multiplied, gives the number. for example, the prime factorization of 60 is 2 ∗ 2 ∗ 3 ∗ 5. in this problem you must write code to recursively find and return the prime factorization of the given number. you must print these in ascending sorted order with spaces in between. for example, if your input is: 120 then you should print the following output: 2 2 2 3 5

We know that if a no x if divisible by y. than (y) and (x/y) are its factors and if they are prime numbers also , then they will be the prime factors.

Using this concept you can make recursive calls printPrimeFactors(y), printPrimeFactors(x/y).

Explanation:

The code in java is explained below in image using comments before each statement.

The output image is also attached.

continuous information you receive.

776 colleges and universities. it is also accredited 3,852 applied and natural science, computing, engineering and engineering technology programs. i hope this .