(Algebra: perfect square) Write a program that prompts the user to enter an integer m and find the smallest integer n such that m * n isa perfect square. (Hint : Store all smallest factors of m into a vector. n is the product of the factors that appear an odd number of times in the vector. For example, consider m = 90, store the factors 2, 3, 3, 5 in a vector. 2 and 5 appear an odd number of times in the vector. So, n is 10.) Here are sample runs:

We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.