Dan has a project consisting of the following tasks. Processing times in hours are listed in parentheses:

F(5), D(5), B(3), M(4), E(3), A(2), C(1), H(3), G(4)

Create a schedule with 2 processors using the critical path algorithm for doing these independent jobs.