In procedure PARALLEL PERMUTATIONS, the processors make extensive use of the shared memory to communicate. Design a parallel algorithm for generating all mpermutations of n items in O("Pmlog m) time...

In procedure PARALLEL PERMUTATIONS, the processors make extensive use of the shared memory to communicate. Design a parallel algorithm for generating all mpermutations of n items in O("Pmlog m) time using m processors that never need to communicate (through shared memory or otherwise). Once the values of n and m have been made known to the processors, the latter operate independently and generate all 'P. permutations lexicographically.