I need this done by hand and not 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 Xij 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 Cijij (ij)EA i=s s.t. Bij Tji = ji 1, 0, Vi EV\{s,t} -1, i=t j:(ij)EA j:(ji) EA Xij > 0, Vi, j) E A Find the dual of this LP problem. Hint: Use the idea learned in finding the dual of maximum flow