2. {12 marks} In this question, we will consider the transshipment problem with the additional constraint that each node has limited in-flow. We are given a digraph D = (N, A), node demands b E RN, arc costs w E R4, and an in-flow limit for the nodes me RN. The constraints are the same as the transshipment problem with the addition of 2(8()) m(S). You should use the feasibility characteri- zation of MCFP to prove this. (c) Use a certificate to verify that the example of TPLIF from part (a) is infeasible. 2. {12 marks} In this question, we will consider the transshipment problem with the additional constraint that each node has limited in-flow. We are given a digraph D = (N, A), node demands b E RN, arc costs w E R4, and an in-flow limit for the nodes me RN. The constraints are the same as the transshipment problem with the addition of 2(8()) m(S). You should use the feasibility characteri- zation of MCFP to prove this. (c) Use a certificate to verify that the example of TPLIF from part (a) is infeasible