Use the information below to construct a project network using the activity$-$on$-$node $($AON$)$ method in order to answer questions that follow.

Activity A $($Predecessor: none$),($Duration in days: $3)$

Activity B $-($Predecessor: A$),($Duration in days: $1)$

Activity C $-($Predecessor: A$),($Duration in days: $4)$

Activity D $-($Predecessor: B$),($Duration in days: $1)$

Activity E $-($Predecessor: B$,$ C$),($Duration in days: $2)$

Activity F $-($Predecessor: E$),($Duration in days: $8)$

Activity F $-($Predecessor: D$),($Duration in days: $2)$

Activity G $-($Predecessor: E$),($Duration in days: $3)$

Activity H $-($Predecessor: E$),($Duration in days: $3)$

Activity I $-($Predecessor: F$,$ G$,$ H$),($Duration in days: $1)$

Activity J $-($Predecessor: I$),($Duration in days: $1)$

What is the late finish $($LF$)$ time for activity E$?$ a$.9$ b$.13$ c$.15$ d$.14$ e$.7$