$($i$)$ Implementation:

$$ Implement a program in C or C$++$ using OpenMP following the algorithm described

above. Think about sufficient data structures for storing the elements. Run your program

for different values of N$,$ i$.$e$.1234567890,23423456780,234780234562$ and

$5067891002343$ if your computer permit. Run your code for different amount of threads

$(4,8,$ and $16).$ What do you observe? For control, always print the list of prime factors

found.

$$ Extend your program with the necessary parallel functionality using MPI. Try to think and

use the collective communication commands. Run your program for same values of N

$($from previous implementation$),$ and different amount of processes $($i$.$e$.4,8,$ and $16).$

What do you observe now? For control, always print the list of prime factors found.