Create a method called prime_factors that accepts a number to perform prime factoring on.
What are the prime factors of 60?
We are left with a remainder of 1, so we have finished the cycle.
Our successful divisors in that computation are 2, 2, 3, and 5.
Verify this yourself below:
2 * 2 * 3 * 5 = 4 * 15 = 60
Any additional libraries needed for this exercise are already included in the code behind the scenes.