This is a question on Operating Systems. Please read carefully and answer. Thank you. This is one question.

There is another real-time scheduling strategy called least-laxity-first (LL), which schedules the process with the smallest laxity first. Laxity = deadline - computation time. Is LL better, same, or worse than ED in terms of its ability to meet processes' deadlines? Justify your answer.

If ED and LL perform equally well, show that you can always change a ED-schedule (meeting all deadlines) to a LL-schedule, and vice versa. Otherwise, show that one scheduler can meet deadlines of a set of processes but the other cannot.