Apply the algorithm of Fig 3.22 to the problem of Exercise 1.
Exercise 1
Consider a cumulative scheduling problem with four jobs in which p = (3, 3, 4, 3), c = (2, 2, 1, 1), and the resource limit is 3.
All release times are zero, and the deadlines are (L1,...,L4) = (6, 6, 6, 7). Apply the edge-finding rules and update the bounds accordingly.