DONT USE ANY PROGRAM (excel,matlab,gams) DON'T!!!! The solution will be by hand. THE SOLUTON WLL BE BY HAND!! MPORTANT!!!! *THE SOLUTON WLL BE BY HAND* PLEASE

Q2) The following figure shows the traffic network of a crowded city. In early mornings, from 7 to 9 am, there are 2000 vehicles that want to travel from node 1 to node 6. The capacities of each arc is given on the network. Formulate an MCNFP that minimizes total time passed in the traffic for all vehicles. (30 points) 1000 1300 2 5 1 1100 350 250 900 6 300 500 1000 Arc 1-2 2-3 1-3 3-4 4-5 2-5 5-6 4-6 3-6 Time (minutes) 25 20 30 10 30 50 10 30 70