Only A&B

48. Consider the project described by the project digraph shown in Fig. 8-37, and assume that you are to schedule this project using N = 2 processors. (a) Use the decreasing-time algorithm to schedule the project. Show the timeline for the project and the fin- ishing time Fin. (b) Find an optimal schedule and the optimal finishing time Opt. Fin - Opt (c) Use the relative error formula = to find the Opt relative error of the schedule found in (a), and express your answer as a percent. A(1) B(6) START(0) O END(0) C(2) D(5) E(3) F(4) FIGURE 8-37 48. Consider the project described by the project digraph shown in Fig. 8-37, and assume that you are to schedule this project using N = 2 processors. (a) Use the decreasing-time algorithm to schedule the project. Show the timeline for the project and the fin- ishing time Fin. (b) Find an optimal schedule and the optimal finishing time Opt. Fin - Opt (c) Use the relative error formula = to find the Opt relative error of the schedule found in (a), and express your answer as a percent. A(1) B(6) START(0) O END(0) C(2) D(5) E(3) F(4) FIGURE 8-37