1.Adapt the message-passing asynchronous approximate agreement algorithm given in Section XXXXXXXXXXfor a shared memory system. 17. Perform a time complexity analysis of the wait-free renaming...

1.Adapt the message-passing asynchronous approximate agreement algorithm given in Section 14.5.5 for a shared memory system. 17. Perform a time complexity analysis of the wait-free renaming algorithm using the atomic snapshot object in asynchronous systems, given in Figure 14.30. Also prove the lower bounds on the size of the name space, as indicated in Section 14.5.6. 2. Show that the solution to Equation (18.30) for the degree distribution in the Extended BA model using continuum theory analysis is given by Equation (18.33).