Help formulate the problem and find the shortest path from node 1 to node 8 . And it's length

II. Find a shortest path from node 1 to node 8 in the network below by formulating the problem as a linear or (binary) integer programming problem and then solving it using Julia. Do NOT use Dijkstra's Algorithm to solve. Provide screenshots of both problem formulation and solution. Write out the shortest path from node 1 to node 8, as well as its length. 3 5 3 5 6 3 6 1 6 2 5 K