Use the (n, n)-merging network defined in problem 3.9 to obtain a network for sorting arbitrary (i.e., not necessarily bitonic) input sequences. Analyze the running time and number of processors used...

Use the (n, n)-merging network defined in problem 3.9 to obtain a network for sorting arbitrary (i.e., not necessarily bitonic) input sequences. Analyze the running time and number of processors used by this network and compare these with the corresponding quantities for the network in section 4.2.