In C programming...Write a function which returns how many time a given number is found when a given integer is written as a product of prime factors.

So if I input 300 and I want to see how many times 5 is found in the product of prime factors the output should be 2.

If I input 33 and I want to see how many times 2 is found in the product of prime factors the output should be 0.

If I input 700 and I want to see how many times 10 is found in the product of prime factors the output should be 2

prototype

int order_of_prime(int n, int d);

Main method

int main()

{

int n,d;

scanf("%d%d",&n,&d);

printf(" %d , %d, %d", d,n,order_of_prime(n,d));

}