Need this written in C++ with detailed documentation

Files below

Stack.h

Stack.cpp

Attached Files: Stack.h (3.339 KB) aStack.cpp (1.31 KB) 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 displays the prime factors in descending order. For example, for n-3960, your program should produce: 11533222 Your solution must use Nyhoff's stack class-the header and implementation files are available here. Submit your .cpp file as an attachment...you need not resend Nyhoff's stack class files as I obviously already have them