Write an efficient MPI program for n node distributed system to implement the following. Assume one of the nodes is Master.

1. Each node generates m random numbers

2. Calculates square of all m random numbers.

3. Identify all pairs of random numbers a and b such that they satisfy the following condition.

c = a2 b2 where c is a perfect square.

4. Send all values of c to the master.

5. Master finds the sum of all c received from all the participating nodes.

Let m and n are given as input by the user.