The n elements of a sequence are input to an n'1 2 x n"/2 mesh-connected SIMD computer, one element per processor. It is required to sort this sequence in row-major order. Derive a lower bound on...

The n elements of a sequence are input to an n'1 2 x n"/2 mesh-connected SIMD computer, one element per processor. It is required to sort this sequence in row-major order. Derive a lower bound on the running time required to solve this problem.