Let Tcomp(n, p) and Tcomm(n, p) denote the parallel computation and communica- tion times, respectively, on a parallel architecture for sorting n elements on p processors. Now consider routing a permutation on this architecture where each processor has a message of size m for another processor such that no two source or destination processors are the same. Design an algorithm to solve this permutation routing problem using only parallel sorting, and compute its run-time.