Plan for an algorithm that can calculate the forward pass and the backward pass (early start early finish, late start and late finish) and the critical path for only 5 activities (including first and last activities in the whole project). the inputs will be duration and precedence provided by the user. the maximum number of preceding activities is two

organize your solution in the best manner possible with comments (e. g. one section for your inputs, a section for your calculations, a section for your outputs).

use python loops and functions (at least one of each)

output should be