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	5	--
B	8	A
C	7	A
D	6	A
E	9	B, C, D
F	10	B, C, D
G	5	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, which of these paths is shortest and what is its length?

Question 6 options:

a	A-B-F-G, 28
b	A-D-E-G, 25
c	A-D-E-G, 20
d	A-C-E-G, 28
e	A-C-E-G. 26