Let the function D[i, j] represent processor demand in the time interval (i, j). Prove the following theorem.
Theorem: For the EDF and RM priority assignment schemes, a set of synchronous, periodic tasks will be schedulable if and only if for all L >= 0, D[0, L] <= L.