Prime factorization is the process of separating a composite number into its prime factors. You are to write a recursive function that accepts a positive integer x, a test divisor, and an array of the current prime factors. It should then output the prime factors of the integer x. For example, the prime factors of 72 are [2,2,2,3,3]. You are required to do the following: 1. Stop the program if invalid inputs are used. 2. Verify that x is a positive integer greater than 1. 3. Verify that divisor is a positive integer in the range (1, 4. Perform the prime factorization of x. 5. The elements in your output array should increase from left to right.