How can the set of processes in the following table be optimally scheduled, using fixed priority scheduling? Is this set of tasks schedulable?

Where $T$ is the minimum time between process executions $($process period$)$; $C$ is the worst$-$case process execution time $($WECT$)$; $B$ is the worst$-$case process blocking time; and $D$ is the process timeout.