(2%) Three periodic tasks have deadlines equal to periods:

T1: $C_1 = 1$ ms, $P_1 = 4$ ms

T2: $C_2 = 1.5$ ms, $P_2 = 6$ ms

T3: $C_3 = 2$ ms, $P_3 = 12$ ms

Assume the standard theoretical model: independent periodic tasks, preemptive uniprocessor, deadline equals period, negligible overhead. Which statement is correct when applying utilization-based schedulability tests?