Question 2 (10 PTS) Telephone calls for the YakLine, a discount long distance carrier, are routed through a variety of switching devices that interconnect various network hubs in different cities. The maximum number of call s that can be handled by each segment of their network is shown in the following table: Network Segments laye so Washington, DC to Chicago Washington, DC to Kansas City Washington, DC to Dallas Chicago to Dallas Chicago to Denver Kansas City to Denver Kansas City to Dallas Denver to San Francisco Dallas to San Francisco Calls (in 1,000s) 800 650 700 725 700 750 625 900 725 YakLine wants to determine the maximum number of calls that can go from its East Coast operations hub in Washington, DC to its West Coast operations hub in San Francisco. Questions: a) Draw a network flow model for this problem. b) Write the LP formulation for this problem. (Do not need to use Solver to solve it)