When several sequences are queued for sorting, the procedure in problem 4.9 has a period of 2n. Show that this period can be reduced to n by allowing both P1 and P. to handle input and output. In this...

When several sequences are queued for sorting, the procedure in problem 4.9 has a period of 2n. Show that this period can be reduced to n by allowing both P1 and P. to handle input and output. In this way, m sequences of n elements each are sorted in (m + I)n steps instead of 2mn.