Write an efficient parallel program with dynamic task assignment that reads n integers from any input file and finds the 2nd largest (without sorting), using p processors (p

_{Write an efficient parallel program with dynamic task assignment that reads n integers from any input file and finds the 2nd largest (without sorting), using p processors (p <>}

_{Assume m is the largest array size slave computers can handle due to memory limitation (m < n/p)="" and="" n="" is="" divisible="" by="">}

_{Note: Master has no memory limitation.}

_{Please do as follow:}

_{Name your file xxxxxH2.c, where xxxxx is at most the first 5 characters of your last name and H2 is the program number.}

_{Remember all I/O should be done ONLY by master.}

_{Your program should be modular i.e. using subprograms.}

_{Make sure to print input data.}

_{Print your name at the end of OUTPUT.}

_{To execute: mpiexec -n p a.out n m <>}

_{Example: mpiexec -n 3 a.out 120 15 <>}