Using the data given in problem $3,$ find graphically the minimum tree emanating

from node $1.$ Using the travel times of the minimum tree path, calculate $Q_{1-2}$ and

$Q_{1-3}$ if $P_1=3100$ trips per day, $A_2=3\mathrm{.}2,A_3=4\mathrm{.}5,$ all other $P_{\text{I}}$ and $A_J=0,$ and all

$K_{ij}=1\mathrm{.}0.$ Use $C=2\mathrm{.}0.$