Q$.$NO$.3$ Draw the precedence network and complete the following table entries, by first assuming

contiguous activities. Repeat the same using interruptible activities and calculate Start restricted float

$($SRF$),$ finish restricted float $($FRF$),$ double restricted float $($DRF$)$ and unrestricted $($URF$)$ and total floats

$($TF$).$

If the relationship type is not mentioned, it is finish to start $($FS$).$ If no lag is mentioned, it is zero.