Assume that the size of the local memory of the processors in the network of problem 5.8 is no longer fixed. Show that if each processor can send or receive one element of S or x at a time, then...

Assume that the size of the local memory of the processors in the network of problem 5.8 is no longer fixed. Show that if each processor can send or receive one element of S or x at a time, then searching S for some x can be done in O(log n/log log n) time.