12 independent graphs with processing times (in hours)
given by 5, 6,7,...., 15, 16.
Schedule tasks with N=2 processors using the Criticle-path
algorithm. Show timeline and projection.