in C++ Description:
For a given integer n > 1, the smallest integer d > 1 that
divides n is a prime factor. We can find the prime
factorization of n if we find d and then replace n by the
quotient of n divided by d, repeating this until n becomes 1.
Write a program that determines the prime factorization of n in
this manner, but that displays the prime factors in descending
order. (When you find a...