GOOD LUCK! CHEATING IS A MAJOR OFFENSE. COMPARING QUESTIONNAIRES IS CONSIDERED CHEATING. Question 1 The figure below shows the possible routes from city A to city M as well as the cost (in dollars) of a trip between each pair of cities. A traveler wishes to find the lowest cost option to travel from city A to city M. Formulate the problem in Solver to find the optimal solution, then determine the following: (Type in the box the numeral corresponding with the correct answer) a. Which of the following paths would be infeasible? Formulate the problem in Solver to find the optimal solution, then determine the following: (Type in the box the numeral corresponding with the correct answer) a. Which of the following paths would be infeasible? 1. $A-B-D-G-J-L-M$ IV. SA-B-D-G-1-M$ II. $A-B-E-G-J-L-M$ V. A-C-F-I-G--L-M III. A-C-F-H-K-M b. Which of the following nodes are not visited? I. $A$ III. C V. $A$ and $C$ 11. B IV. $A$ and $B$ c. What is the minimum cost for the traveler to move from node A to node M? 1. $1$ 67$ III. $15 96$ V. $1$ 1165 11. $\$ 865 IV. $\$ 106$ SP.SD.011