The sequence of comparisons in the odd-even merging network can be viewed as a parallel algorithm. Describe an implementation of that algorithm on an SIMD computer where the processors are connected to form a linear array. The two input sequences to be merged initially occupy processors P, to P, and P,,, to P,, respectively. When the algorithm terminates, Pi should contain the ith smallest element of the output sequence.