Implement a Critical Path Procedure in either C++ or Java using the following table. The goal is to find the min amount of time required to complete all the tasks.

Use arrays ES[], EF[] ,LS[] , LF[] for computing earliest start time, earliest finish time, latest start time and latest finish time respectively.

The graph of the project is represented by an an matrix (adjacency matrix) matrix[][] and the array TS[] represents the sequence of the tasks listed according to topological sorting.

Task	Predecessors	Time needed for the task
0	Null	2
1	0	4
2	0	5
3	0	9
4	1	3
5	1,2,3	2
6	4,5	1
7	5	10
8	3	11
9	6,7	6
10	8	9
11	8	8
12	9,10,11	7