The odd-even sorting network of section 4.2 uses O(n log2n) processors to sort a sequence of length n in O(log 2n) time. For some applications, this may be too slow. On the other hand, the...

The odd-even sorting network of section 4.2 uses O(n log2n) processors to sort a sequence of length n in O(log 2n) time. For some applications, this may be too slow. On the other hand, the architecture in problem 4.2 sorts in O(log n) time using n 2 processors. Again, when n is large, this number of processors is prohibitive. Can you design a network that combines the features of these two algorithms, that is, one that uses O(n log2n) processors and sorts in O(log n) time?