Assume that an interconnection network SIMD computer with n processors can sort a sequence of length n in 0(f(n)) time. Show that this network can simulate an algorithm requiring time T on an EREW SM...

Assume that an interconnection network SIMD computer with n processors can sort a sequence of length n in 0(f(n)) time. Show that this network can simulate an algorithm requiring time T on an EREW SM SIMD computer with n memory locations and n processors in O(Tf(n)) time.