PLEASE DO NOT USE AN AI$-$GENERATED SOLUTION IF YOU WANT THUMBS$-$UP RATING!! I would appreciate a written solution. Refer to Picture for Diagram.

Using the following trip distribution matrix $($Table $1)$ and the road network $($Figure $1)$:

$1)$ Identify the minimum path between each TAZ pair. $(4$ marks$)$

$2)$ Estimate the traffic flow on each link. $(4$ marks$)$

Figure $1.$ Road Network

Table $1.$ Trip Distribution Matrix

O$-$D $1234567$

$101202819904354118513581188$

$21865013004564912801465$

$315986732047778281036523$

$4111075021517025981936781$

$512506210108910757063094042$

$688133508384928387803973$

$768317253751763220235220$

$147$

$2$

$3$

$5$

$6$

$5$ min

$8$ min

$3\mathrm{.}5$ min $4$ min

Question $2$:

Using the following trip distribution matrix $($Table $1)$ and the road network $($Figure $1)$:

Identify the minimum path between each TAZ pair. $(4$ marks$)$ Estimate the traffic flow on each link. $(4$ marks$)$

Table $1.$ Trip Distribution Matrix

O$-$D $1234567101202819904354118513581188218650130045649128014653159867320477782810365234111075021517025981936781512506210108910757063094042688133508384928387803973768317253751763220235220$