Consider the Following Shortest-Route Problem Involving Seven Cities

Consider the following shortest-route problem involving seven cities.The distances between the cities are given below.Draw the network model for this problem and formulate the LP for finding the shortest route from City 1 to City 7.
$$\begin{array} { l c } \text { Path } & \text { Distance } \\\hline 1 \text { to } 2 & 6 \\1 \text { to } 3 & 10 \\1 \text { to } 4 & 7 \\2 \text { to } 3 & 4 \\2 \text { to } 5 & 5 \\3 \text { to } 4 & 5 \\3 \text { to } 5 & 2 \\3 \text { to } 6 & 4 \\4 \text { to } 6 & 8 \\5 \text { to } 7 & 7 \\6 \text { to } 7 & 5\end{array}$$