The code of C++. What is the code of this question.

The factorial of a number N (written N!) is defined as the product of all the integers from 1 to N. It is often defined recursively as follows 0!-1 (By definition) N-N x(N -1)! Factorials grow very rapidly (5! 120, 10! 3,628,800). One way of specifying such large numbers is by specifying the number of times each prime number occurs in it. Thus 825 could be specified as (0 1 20 1) (or, (2,0) (3,1) (5,2) (7,0) (11,1)) meaning no twos, 1 three, 2 fives, no sevens and 1 eleven. For this assignment, we will follow the notation as 825 (2o)*(31)"(5*2)*(7A0) (111) Write a complete C program that read in an integer number N (limited by 2 N 100) and write out its factorial in terms of the numbers of its prime factors, using the output notation explained above Your program should implement the following 2 functions a. findPrimeCount), that will count the number of a given prime in N! b. isPrime(), that will determine whether a number is a prime number or not. Hint 1. You do not have to actually calculate the factorial of any number to solve this problem 2. Given the first prime number 2, your program logic will a. Determine how many times this prime number will occur in N! b. Then the program will determine what is the next prime number, and go back to step c. Steps a. and b. will continue until all the prime numbers N are evaluated (2*3), and the prime 3 occurs only one time, (31). So 4! - (2*3)*(3A1). Likewise 3. For example: 41 = 2X3X4, where the prime 2 occurs three times (2x4) = (2x2x2) = 5! - (2*3)*(31) (51)