Q$1$

For the task graph show below show that a priority driven schedule with non$-$preemption will

produce a better schedule than priority driven schedule with pre$-$emption

All tasks are aperiodic with a deadline of $12.$ All tasks except for J$5$ release at $0.$ J$5$ releases at

$4.$ The priority of jobs is such that J$1$ has a higher priority when compared to J$2$ has a higher

priority when compared to J$3$ and so on$.$ The scheduling is done on a processor which has dual

identical cores with jobs migratable at any point in time.