2. Complete the parallel pseudocode given in chapter 4 slide 24-25 for the binary divide-and- conquer method for all eight processes. Given the root PO and intermediate level P4 as below. (5m) Process Po division phase / divide (si, si, s2); "divide si into two, si and s2 */ send (s2, P.): 1 send one part to another process / divide (si, si, s2); send (s2, P2); divide (si, si, s2); send (S2, P.); part_sum = 1; combining phase / recv(&part_sumi, P.); part sum = part_sum part sumi; recv(&part_sumi, P); part_sum = part_sum + part_sumi; recv(&part_sumi, P.): part_sum = part_sum - part_sumi; The code for process P4 might take the form Process PA recv(si, Po); /* division phase divide(si, si, s2); send (s2, Ps): divide (si, s1, 32); send(s2. Ps): part_sum-*51; y combining phase recv(&part_sumi, Ps): part_sum - part_sum + part_sumi; recv(&part_sum, Pg: part_sum = part_sum - part_sumi; send (&part_sum, Po); Partitioning and Divide-and-Conquer Strategies Chap. 4