This example has level resources of three resources for eight days. If the project is limited to two resources, how should the project be organized to meet the resource constraint and finish the project as early as possible? The tasks with the least slack have the lower number.

a$.$

Paths would be $1,2$ and $3,4,5$

b$.$

Path would be $1,2,3,4,5$

c$.$

Paths would be $1,2,3,5$ and $1,2,4$

d$.$

Paths would be $1,2,3,4$ and $1,2,5$