Let the model of computation described in problem 2.9, that is, a linear array of N processors with a bus, be available. Each processor has a copy of a sorted sequence S of n distinct elements....

Let the model of computation described in problem 2.9, that is, a linear array of N processors with a bus, be available. Each processor has a copy of a sorted sequence S of n distinct elements. Describe an algorithm for searching S for a given value x on this model and compare its running time to that of procedure CREW SEARCH.