Determine the shortest route from node $1($origin$)$ to node $12$

$($destination$)$ for the following network. Distances are given along the

A network has nodes $1$ through $12$ Distances of the branches arest

follows.

From node $1\mathrm{.}7$ to node $2\mathrm{.}2$ to node $3\mathrm{.}3$ to node $4\mathrm{.}4$ to node $7.$

From node $2\mathrm{.}4$ to node $3\mathrm{.}2$ to node $5\mathrm{.}7$ to node $6.$

From node $3\mathrm{.}7$ to node $4\mathrm{.}8$ to node $5\mathrm{.}3$ to node $7\mathrm{.}12$ to node $9.$

From node $4\mathrm{.}9$ to node $7\mathrm{.}11$ to node $8\mathrm{.}7$ to node $11.$

From node $5\mathrm{.}6$ to node $6\mathrm{.}10$ to node $10.$

From node $6\mathrm{.}5$ to node $7\mathrm{.}9$ to node $9\mathrm{.}6$ to node $10.$

From node $7\mathrm{.}6$ to node $8\mathrm{.}8$ to node $11.$

From node $8.10$ to node $11.$

From node $9\mathrm{.}2$ to node $10\mathrm{.}5$ to node $11\mathrm{.}11$ to node $12.$

From node $10\mathrm{.}8$ to node $11\mathrm{.}3$ to node $12.$

From node $11\mathrm{.}9$ to node $12.$

Use Excel solver, use constraints.