Problem $5.$

Determine whether there is a feasible schedule for the following set of periodic nonpreemptive processes. If yes, show the schedule and the steps used to derive it$.$

$T1$: $c_{1,1}=6,c_{1,2}=9,c_{1,3}=9,d_1=p_1=63$

$T2$: $c_{2,1}=3,c_{2,2}=6,d_2=18,p_2=21$

$T3$: $c_3=12,d_3=p_3=63$

T$1$ must rendezvous with T$2$ after the first, second, and third scheduling blocks. T$2$ must rendezvous with T$1$ after the first scheduling block.