Given the project network shown below, the earliest finish time for activity e is:

A precedence network with $7$ nodes.In the precedence network the start node is a and the end node is g$.$ The paths in the network are as follow:a$-$b$-$e$-$g;a$-$b$-$d$-$e$-$g; a$-$b$-$d$-$f$-$g; a$-$c$-$d$-$f$-$g; a$-$c$-$d$-$e$-$g; The time associated with each node is as follows: a$,4$; b$,5$; c$,7$; d$.2$; e$,3$; f$.3$; and g$.6.$

Multiple Choice

$13$

$16$

$22$

$11$

$24$