1. Develop the equations for computation and communication times for m-ary divide and conquer, following the approach used in Section 4.1.2. 2. Develop a divide-and-conquer algorithm that finds the...

1. Develop the equations for computation and communication times for m-ary divide and conquer, following the approach used in Section 4.1.2.

2. Develop a divide-and-conquer algorithm that finds the smallest value in a set of n values in Ο(logn) steps using n/2 processors. What is the time complexity if there are fewer than n/2 processors?