Show that procedure CREW MERGE can be simulated on an EREW computer in O((n/N) + log2 n) time if a way can be found to distinguish between simple read operations (each processor needs to gain access...

Show that procedure CREW MERGE can be simulated on an EREW computer in O((n/N) + log2 n) time if a way can be found to distinguish between simple read operations (each processor needs to gain access to a different memory location) and multiple-read operations.