Design a CPM problem, to find a minimum cost schedule by doing the following task:

Create a network diagram with at least 6 activities. Define the duration of these activities, in order to ended up with at least two critical paths.

Establish the normal cost of the activities, crashing costs, and crash times.

Define the overhead cost and penalty cost. The resulting problem should have 2 critical paths. Provide a full solution on how you can improve the overall duration of the project (i.e., show/explain the process of doing so).

Can someone please explain how you would do this?