Problem 3:Consider a set of three periodic tasks with the execution profiles shown below:

Process	Arrival Time	Execution Time	Ending Deadline
A(1)	0	10	20
A(2)	20	10	40
A(3)	40	10	60
...	...	...	...
...	...	...	...
B(1)	0	10	50
B(2)	50	10	100
B(3)	100	10	150
...	...	...	...
...	...	...	...
C(1)	0	15	50
C(2)	50	15	100
C(3)	100	15	150
...	...	...	...
...	...	...	...

Develop a set of scheduling diagrams depicting how these jobs will be scheduled using:

A.Fixed-priority scheduling (A has priority over B and B has priority over C)

B.Fixed-priority scheduling (C has priority over B and B has priority over A)

C.Earliest-deadline scheduling