2-1. Develop an equation for message communication time, tcomm, that incorporates a delay through multiple links as would occur in a static interconnection network. Develop the equation for a mesh assuming that all message destinations are randomly chosen. 2-2. Pointers are used in the send and receive used in book and in MPI, but they can be avoided by passing the arguments by value. For example, pointers can be eliminated in the receive routine by having the routing return the message data, which then can be assigned to a variable, i.e., x = recv (sourceID). Write new routines to "wrap" around regular MPI send and receive routines to avoid pointers and demonstrate their use. 2-3. To send a message from a specific source process to a specific destination process, it is necessary for the source process to know the destination TID (task identification) or rank and for the destination to know the source TID or rank. Explain how each process can obtain the TID or rank of the other process in MPI. Give a program example. 2-4. (A suitable first assignment) Compile and run the MPI program to add numbers, as given in Figures 2.14 and 2.16 (or as found in http://www.cs.uncc.edu/par_prog as the "sample program" in the compiling instructions) and execute on your system. Modify the program so that the maximum number is found and output as well as the sum