Consider the following set of three processes:

Process	Period, T	Computation time, C	Blocking time, B	Deadline, D
a	8	4	2	8
b	10	2	2	5
c	30	5	2	30

To schedule these optimally, you need to assign priorities by the deadline monotonic rule. Use preemptive scheduling. Perform the response time analysis on these processes and verify they are schedulable. Note that during RTA, you need to include blocking times also. Show all the steps and the algorithm logic. Also, show a Gantt chart of your schedule.