A F G 5 4 3 Lag 2 E Lag 3 4 Lag 2 Lag 4 B C D 1 2 6 Laddering: If tasks C and D above could be laddered by dividing each into two equal subtasks, how much time would be saved on this part of the AON path? Try this one: Ladder by dividing each into 3 equal subtasks. How much time is saved? A 3 B 9 12 A F G 5 4 3 Lag 2 E Lag 3 4 Lag 2 Lag 4 B C D 1 2 6 Laddering: If tasks C and D above could be laddered by dividing each into two equal subtasks, how much time would be saved on this part of the AON path? Try this one: Ladder by dividing each into 3 equal subtasks. How much time is saved? A 3 B 9 12