7) Factor an input integer into it's prime numbers. Create a

structure to hold the array of prime numbers. Any number between

[2,10000] where n is not a prime > 100 will be a valid number to

check for prime factors.

struct Prime{

unsigned char prime;

unsigned char power;

};

struct Primes{

Prime *prime;

unsigned char nPrimes;

};

Output the number and it's primes -> 120 = 2^3*3^1*5^1

So create a function

Primes *factor(int);-> Input an integer, return all prime factors

void prntPrm(Primes *); -> Output all prime factors

\*

So basically, the use the two structures as exampled (Struct Prime, Struct Primes) as well as the functions (Primes *factor(int) and void prntPrm(Primes *)). The goal is to have the user input a number between 2 and 10,000. And export that numbers prime numbers that are factors of the number input from the user.