Show the reduction of the following multi-source, multi-sink max flow problem to a single-source, single-sink max flow problem. Show the single-source, single-sink solution by drawing the final network flow diagram and also listing each flow by its route and flow amount (e.g. {s_2, v_8, V_12, t_2}, |f| = 3). Show the reduction of the following multi-source, multi-sink max flow problem to a single-source, single-sink max flow problem. Show the single-source, single-sink solution by drawing the final network flow diagram and also listing each flow by its route and flow amount (e.g. {s_2, v_8, V_12, t_2}, |f| = 3)