Consider the network below, where node 1 is the source node and node 7 is the destination node and our goal is to find the shortest path between these two nodes. Construct the constraint which correctly enforces proper flow in/out of node 1. The shortest path problem