Use MPI to implement a hypercube communication template (hint see attached) Solution Answering without hint. using example scenario write a parallel program for adding n numbers on a p processor HyperCube. Assume that n = a * (p log p)where a is suitable integer constant. Draw theoretical conclusions about the the cost optimality, efficiency, and scalability of parallel system for different values of n and p . The program should automatically handle efficient partitioning the input numbers and implement the algorithm with minimum amount of communication One can generate the initial input n/p numbers on every processor by knowing the values n (= p logp) on a p processor hypercube. Print the result on master processor whose task id is 0. Let the dimension of your target machine be four, giving total of 16 nodes (processors) in your HyperCube on PARAM 10000. The input n (n = p log p) integers are partitioned among p (p=n) processors such that every processor gets equal number of integer values. In fact, for data, let each processor generates corresponding integer values such as n(=p log p) processors. Print the result of adding n integers , followed by task id ( process id number ) followed by the name of the host machine on the master node with task id 0..