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

A $10--$

B $20$ A

C $5$ A

D $3$ B$,$ C

E $20$ B$,$ C

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.