Please don't answer with Python

= Problem 3. In the given a direct network N = (V, A) with arc cost (or length) Cij > 0 for arc (i,j) E A, Identify a shortest path from the source node s to the sink node t. Let lij E {0,1} be a binary variable to decide whether an arc is included in the shortest path or not (this one can be relaxed to Xij > 0 as explained in class). This general shortest path problem can be formulated as min Cijlij (1,7) EA i=s s.t. Lij Dji 1, 0, Vi e V\{s,t} -1, = t j:(,j)EA j:(,1)EA Xij > 0, Wi, j) E A Find the dual of this LP problem. Hint: Use the idea learned in finding the dual of maximum flow