measures her deterministic task$-$parallel algorithm on $4,10,$ and $64$ processors of an ideal parallel computer using a greedy scheduler. She claims that the three runs yielded $T4=80$ seconds, $T10=42$ seconds, and $T64=10$ seconds. Argue that the professor is either lying or incompetent.