\begin{tabular}{|c|c|} \hline Path & Distance \\ \hline 1 to 2 & 4 \\ \hline 1 to 3 & 2 \\ \hline 2 to 4 & 3 \\ \hline 2 to 5 & 6 \\ \hline 3 to 4 & 2 \\ \hline 3 to 5 & 8 \\ \hline 4 to 6 & 5 \\ \hline 5 to 6 & 2 \\ \hline \end{tabular} Formulate the LP for finding the shortest distance from City 1 to City 6 . (Let xij represent the flow from node i to node j.) Min