Make or invent a parallel algorithm to solve the primality problem for the positive integer n . At the end of the algorithm, every processor should know whether or not n is prime. Further, if n is not...

Make or invent a parallel algorithm to solve the primality problem for the positive integern.
At the end of the algorithm, every processor should know whether or notn is prime.
Further, ifnis not prime, every processor should know the smallest prime factor ofn. Also, assume that no list of primes is initially stored in memory. Assuming [n^1/2] processors, provide an analysis of the number of parallel operations used by your algorithm on the following.

1. CREW PRAM


2. EREW PRAM


3. Mesh


4. Hypercube