Problem 1: A company operates trucks that sell food. There are 100 trucks in total. There are eight routes that can be used, each starting at s and ending at t. To each route, a certain per-truck revenue is associated, see the table below. Route ID Revenue Nodes used 1 190 8, 1, 1, t 1000 2 200 8, 1, 2, 3 100 8, 2, 1, t 3000 4 300 8, 2, 3, t $ 700 5 400 8, 3, 3, t 2000 6 150 8, 3, 4, t 7 570 8, 4, 3, t 1500 8 70 8, 5, 4, t A OW ON 102 88 157 234 In addition, the company will incur a cost in operating the trucks, as indicate in the figure: (a) The numbers on the left, in bold indicate a fixed cost for the arc. If we don't pay the cost the arc is not going to be available. If we pay the cost, the arc will be available and could carry all the trucks we want. (b) The arcs shown in the middle, in bold, have no cost, but each can carry at most 30 trucks. (c) The arcs on the right do not have any fixed cost and have infinite capacity. The numbers shown next to the arcs are per-truck costs. 1. Formulate the problem of maximizing net revenue as an optimization problem using both binary and continuous variables (to represent quantities of trucks per route). 2. Solve it using Gurobi or your favorite solver (submit the .lp file and resultfile). Report the formu- lation and the screenshot of the output of the solver.