CS Operation System:

Q:

***Correct answer will receive a upvote, wrong answer will receive a downvote. Thank you!

We have two processes P1 and P2. The process P1 has a period of p1=50 and a CPU bust of t1=10; the process P2 has a period of p2=40 and a CPU burst time of t2=20. The deadline for each process requires that it completes its CPU burst by the start of its next period. Now we have 100 time slices, please use the rate-monotonic algorithm to schedule these two processes P1 and P2; point out whether these two processes complete their first tasks before their first deadline, and compute the average waiting time