We could define a variant of McNaughton's wrap-around rule for QlpmtnlCmax which takes the jobs in decreasing order of speed and also takes the jobs in decreasing order of processing time. It then tries to fill the first machine, and wraps around to the second machine if necessary, continuing through the machines in order. Does this rule give an optimal algorithm for QlpmtnlCmax? Why or why not? We could define a variant of McNaughton's wrap-around rule for QlpmtnlCmax which takes the jobs in decreasing order of speed and also takes the jobs in decreasing order of processing time. It then tries to fill the first machine, and wraps around to the second machine if necessary, continuing through the machines in order. Does this rule give an optimal algorithm for QlpmtnlCmax? Why or why not