n periodic processes are sharing the CPU. The total CPU time for each process is $2$ ms$.$

The period must be at least ms for EDF $[$Earliest Deadline First$]$ to produce a feasible schedule when $n=4.$

$2$

$4$

$10$

$8$B