consider following network

Consider the following network, where the nodes are facilities, and the distance between the facilities are shown next to the directed arcs. (a) Formulate the problem of finding the minimum distance path from A to F as a linear program. (b) Find minimum distance paths from facility A to facilities D,E, and F using Dijkstra's algorithm