Magic Mufflers and Brakes has five cars waiting to be repaired. Only one car can be worked on at a time. The number of days required to repair each car and the customer promise date for each are given below:

$\backslash$table$[[$Car$,$Repair Time $($days$),$Promise Date$],[1,3,5],[2,2,6],[3,1,9],[4,4,11],[5,5,8]]$

Compare the performance of the three dispatching rules we discussed in class $($FCFS$,$ SPT and EDD$)$ with respect to minimizing number of tardy jobs.