2.2 Analyze the time complexity of the convergecast algorithm of Section 2.2 when communication is synchronous and when communication is asyn- chronous. Hint: For the synchronous case, prove that during round + + 1, a processor at height / sends a message to its parent. For the asynchronous case, prove that by time t, a processor at height t has sent a message to its parent.