Fix findPrimeFactorsOfProduct

[J4unty]

There is currently a method called findPrimeFactorsOfProduct that lives in /lib/findPrimeFactorsOfProduct.js. It is incomplete and needs to be fixed!

Write a Function that returns the two prime factors of a given Product. E.g: 6 => [2,3]; 21 => [3,7];

(For more information on input checking and other test cases look at /test/findPrimeFactorsOfProduct.test.js)

Acceptance Criteria:

1. Running yarn test findPrimeFactorsOfProduct results in tests passing.
2. You have written a skeleton method for someone else to work on.
3. You have written tests surrounding your skeleton method.
4. Running yarn lint does not print any errors to the console!
5. Optional: write one or two more tests surrounding the method you are solving to account for potential edge cases.

Please include the skeleton of a new method + an accompanying test for someone else to work on at the time of creating a pull request! A pull request will most likely be denied if it does not contain a skeleton method for someone else to work on! For more information, please read the Contributing Guide.

Thank you so much for your contribution!