Node 4 Node 2 3 5 Supply TABLE 3 Transshipment Representation of Shortest-Path Problem and Optimal Solution (1) 4 M M M 1 0 M 3 2 M 2 1 M 0 ME 3 M 1 M M 0 M | 2 M M ar 0 | 2 5 1 Demand 1 1 2 z = 3 + 3 + 2 = 8, X13 = x3s = *56 = X22 = *44 = 1 (all other variables equal o). This solution corresponds to the path 1-3-5-6. Provide: the node-are incidence matrix for the network, LP model (including definition of variables), optimal solution, and optimal objective value