The travel time for each link is given for the street network below. Note, there are a total of $\backslash (\backslash$mathbf$\{13\}\backslash )$ nodes.

Consider the trip table as

$\backslash$begin$\{$tabular$\}\{|$c$|$c$|$c$|$c$|$c$|\}$

$\backslash$hline & Zone A & Zone B & Zone C & Zone D $\backslash \backslash$

$\backslash$hline Zone A & $0$ & $0$ & $400$ & $200\backslash \backslash$

$\backslash$hline Zone B & $0$ & $0$ & $300$ & $100\backslash \backslash$

$\backslash$hline Zone C & $0$ & $0$ & $0$ & $0\backslash \backslash$

$\backslash$hline Zone D & $0$ & $0$ & $0$ & $0\backslash \backslash$

$\backslash$hline

$\backslash$end$\{$tabular$\}$

Please compute the link volume using all$-$or$-$nothing traffic assignment algorithm. Hint: do not confuse zones with nodes. There are $13$ nodes in this street network.