Hello the question is the following:Write the definitions of the functions of the class primeFactorization (Example 11-4) declared in the primeFactorization header file. Write a program that uses this class to output the prime factorization of an integer. Your program should prompt the user for an integer, determine if the input is a prime number, and display the factorization of the integer.An example of the program is shown below:Enter an integer between 2 and 270,000,000,000,000: 1005427 1005427 is a prime number. Its factorization is: 1005427 = 1005427I need help with write three things: integerManipulationImp.cpp, primeFactorizationImp.cpp, and a main.cpp.The attached images are the .h files respective to the cpp files that are needed to answer this question.Thank you. #ifndef integerManipulation#define integerManipulationclass integerManipulation€public:void setNum(long long n);//Function to set num.//Postcondition: num = n;long long getNum();//Function to return num.//Postcondition: The value of num is returned.void reverseNum();//Function to reverse the digits of num.//Postcondition: revNum is set to num with digits inin the reverse order.HHvoid classifyDigits();//Function to count the even, odd, and zero digits of num.//Postcondition: evenCount = the number of even digits in num.oddCount = the number of odd digits in num.int getEvensCount();//Function to return the number of even digits in num.//Postcondition: The value of evensCount is returned.int getOddsCount();//Function to return the number of odd digits in num.//Postcondition: The value of oddscount is returned.int getZerosCount();//Function to return the number of zeros in num.//Postcondition: The value of zerosCount is returned.int sumDigits();//Function to return the sum of the digits of num.//Postcondition: The sum of the digits is returned.integerManipulation (long long n = 0);//Constructor with a default parameter.//The instance variable num is set according to the parameter,//and other instance variables are set to zero.//The default value of num is 0;//Postcondition: num = n; zevNum = 0; evenscount = 0;oddsCount = 0; zerosCount = 0;private:long long num;long long revNum;int evensCount;int oddsCount;int zerosCount;};#endif 1 #ifndef primeFactorization_H2 #define primeFactorization_H34 #include "integerManipulation.h"56 class primeFactorization: public integerManipulation7 {8 public:9101156121314 primeFactorization (long long n = 0);1516293031factorization();//Function to output the prime factorization of num//Postcondition: Prime factorization of num is printed;3233343536void17181920212223 private:242526272837 };38//Constructor with a default parameter.//The instance variables of the base class are set according//to the parameters and the array first125000Primes is//created.//Postcondition: num = n; revNum = 0; evenscount = 0;// oddsCount = 0; zerosCount = 0;//first125000Primes= first 125000 prime numbers.long long first125000Primes [125000];void primeFact(long long num, long long list [], int length,int firstPrimeFact Index);void first125000PrimeNum (long long list[], int length);//Function to determine and store the first 125000 prime//integers.//Postcondition: The first 125000 prime numbers are// determined and stored in the array first125000Primes;void primeTest (long long num, long long list[], int length,bool& primeNum, int& firstPrimeFact Index);bool isPrime(long long number);39 #endif40

Algorithm: 1. Start the program.2. Prompt the user to enter an integer between 2 and…

Answered: Hello the question is the following:…

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE