MPI Lab 4 Solve Parallel Sum by divide-and-conquer Description: Assume there are 16 processing nodes and there are 992 numbers to be added. Each processing node Pi will work on 992/16-62 numbers and get a partial sum Si. Then 16 processing nodes will do the parallel sum collection to a total sum as follows: Po P, P2 P3 P4 PP6p, Ps P, P10 Pil P12 P13 P14 P15 Task I: Start with either the program which you wrote for Lab 2, or the MPISendRecieve program on the BlackBoard site. Revise the program to use the above method to collect the partial sums of the respective processes to the total sum. Task II: This assignment focuses on the technique of non-linear Divide and Conquer based on a binary tree representation of the available processors. Describe the process of dividing the processor work pool. 1. How many levels of the tree will there be? 2. How many interior nodes will there be? 3. How many leaf nodes will there be? MPI Lab 4 Solve Parallel Sum by divide-and-conquer Description: Assume there are 16 processing nodes and there are 992 numbers to be added. Each processing node Pi will work on 992/16-62 numbers and get a partial sum Si. Then 16 processing nodes will do the parallel sum collection to a total sum as follows: Po P, P2 P3 P4 PP6p, Ps P, P10 Pil P12 P13 P14 P15 Task I: Start with either the program which you wrote for Lab 2, or the MPISendRecieve program on the BlackBoard site. Revise the program to use the above method to collect the partial sums of the respective processes to the total sum. Task II: This assignment focuses on the technique of non-linear Divide and Conquer based on a binary tree representation of the available processors. Describe the process of dividing the processor work pool. 1. How many levels of the tree will there be? 2. How many interior nodes will there be? 3. How many leaf nodes will there be