You will write three methods in this questions. The first method called inputGetter will check the input if it is a positive integer. It will ask for a new input until the user enters a positive integer and returns the valid integer N. Then, this integer N will be utilized as a parameter for the second method called primeFactorization. This method will get the number N and returns a two-dimensional array that shows the prime factors and how many times each factor exists in this number. The first element of the array will be the prime factor, the second element will show how many times this factor exists. Then, the last method print will get this array and prints all elements as exactly as it is shown in the output example runs.
You will write three methods in this questions. The first method called inputGetter will check the input if it is a positive integer. It will ask for a new input until the user enters a positive integer and returns the valid integer N. Then, this integer N will be utilized as a parameter for the second method called primeFactorization. This method will get the number N and returns a two-dimensional array that shows the prime factors and how many times each factor exists in this number. The first element of the array will be the prime factor, the second element will show how many times this factor exists. Then, the last method print will get this array and prints all elements as exactly as it is shown in the output example runs.
![Example RUN 1:
Example RUN 2:
Please enter a number:
Please enter a number:
195
-12
The output array is:
Please enter a positive integer:
3 1
5 1
Please enter a positive integer:
13 1
100
Example RUN 3:
The output array is:
Please enter a number.
22
420
52
The output array is:
22
31
51
71](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc0669b1b-6fcd-4b33-a0e6-777e25f0250f%2Fcabfff52-dd44-4523-b51a-ca4577ddb606%2Fhij5jmf_processed.jpeg&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 3 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)