suppose $$a $$very $$simple $$scheduling $$network $$has $$only $$two $$entirely $$parallel $$paths $$

$($

no $$shared $$edges

$)$

$$from $$the $$start $$of $$the $$process $$to $$the $$end$.$Femurrther $$suppose $$the $$shorter $$of $$the $$paths $$takes $$a $$cumulative $$

$60$

$$seconds $$to $$complete $$and $$the $$longer $$path $$takes $$

$90$

$$seconds $$to $$complete$.$If $$an $$edge $$in $$the $$shorter $$path $$is $$increased $$by $$

$45$

$$seconds$,$how $$long $$will $$the $$operation $$take $$in $$total$?$

$($

Assume $$each $$of $$the $$teo $$parallel $$parhs $$have $$entirely $$squential $$steps $$from $$the $$beginning $$to $$the $$end$,$and $$two $$processors

$/$

workers $$are $$always $$available

$)$