Prof Johnson measures his deterministic multithreaded algorithm on 4, 10, and 64 processors of an ideal parallel computer using a greedy scheduler. He claims three runs yield T4 D 80 seconds, T10 D 42 seconds, and T64 D 10 seconds. Tell whether the prof is lying or wrong. (Clue: Use the work law (27.2), the span law (27.3), and inequality (27.5) from Exercise 27.1-3.)