c++ please include comments

Fundamental Theorem of Arithmetic The fusdanetial theceem of eithncdic stles Every positive inbeger greater thaa 1 ran be repeested as e idring pime fuctorizatn (peduct of priza Create a progrem tht is a pele Stocisotion ccltor for isteges betuecen 2 ad 1000 The peogram shoud peompt the uer to ester a podtive wanber gneater than 1, and then, it displays the prime 6 the progon hould disp 62317 Furtber, the program svald asti to peceupt the r il wr Yr progas o gserate the prime naben it coanot just rad the awbens from a fle ohave at least thre Sunctiosexlding the main fartion ace irlale prime munders vrh oro pows in the pritar, fartariaatin of the aput of the O yoe finish with ywar peogran, the prgrm to lalp aesvr the following b) if uo where p and y are both primes whst is in) ad rin) |r) ifn=r" tree pla prime and m > 1, what kotol and r( ? Fur extra erolit, ernte n file that lists the prime factorization ur ill the-timbers between 2 and 0, in ascending order