If the service order in part $($a$)$ had been Shortest$-$Job$-$First $($SJF$),$ would the

same technique have worked for computing mean slowdown?