a$)[15$ points$]$ Consider some simple greedy strategies. a$)$ Schedule the shortest job first.

b$)$ Schedule the job with the biggest priority first. Give counter$-$examples for both

these strategies.

$($b$)[15$ points$]$ Your greedy choice property should clearly consider both priorities and

running time. Think about two cases to develop intuition.

$$ two tasks have the same priority, but have different running times ti $<$ tj $,$ then

which one would you schedule first?

$$ two tasks have the same running time, but have different priorities pi $<$ pj $,$ then

which one would you schedule first?