Consider the following table of activities A through G in which A is the start node and G is the stop node. Activity Duration (days) Predecessor 10 A B 20 A 5 5 A D 3 B, C 20 B, C E F 4 B, C G 10 D, E, F On a piece of scratch paper, draw the network associated with this table and determine the following. Considering the lengths of all the paths, this project is _____ with maximum slack associated with any one activity of _days. Insensitive, 2 Sensitive, 2 Insensitive, 15 Sensitive, 15 Insensitive, 17