It was shown in section 5.2.2 that procedure CREW SEARCH achieves the best possible running time for searching. In view of the lower bound in problem 5.1, show that no procedure faster than MULTIPLE...

It was shown in section 5.2.2 that procedure CREW SEARCH achieves the best possible running time for searching. In view of the lower bound in problem 5.1, show that no procedure faster than MULTIPLE BROADCAST of section 3.4 exists for simulating a CREW algorithm on an EREW computer.