Consider the project management problem described by the following table:
| Job | Duration (days) | Immediate predecessor |
| A | 3 | --- |
| B | 4 | --- |
| C | 5 | --- |
| D | 2 | --- |
| E | 4 | A,B |
| F | 3 | A,B |
| G | 3 | C,E |
| H | 5 | D,F |
a. Draw the network representing this problem.
b. Compute the total float and free float for each job.
c. Identify the critical path(s) and critical activities.
d. Draw the Gantt Chart for this problem.
e. Re-Draw the network for the case where E is also an immediate predecessor of H.