Use python

3. Solve cell phone problem using python and gurobi. If you are not in or have not yet taken INSY 3010 you may solve the problem using the excel solver (only if you have already met with me about adjusting assignments in this class to not use python and this must be clearly marked on your assignment). Submit your .py file on Canvas and include the optimal solution and what it means in the context of the problem, in your written submission. You need to buy a new cell phone now, and are trying to minimize your cell phone costs for the next 5 years. A new cell phone costs C dollars and lasts for at most 3 years. The estimated maintenance cost for a phone depends on its age - if a phone is in its ith year of life, the cost will be Mi dollars, i - 1,2,3. Assuming cell phones have no salvage value and that you have the option each year of buying a new phone (for C dollars), formulate a network model that will minimize your costs over the next 5 years. [Hint: it can be modeled a shortest path problem.] Problem data: 200 M1 20 M2- 10 M3 50 3. Solve cell phone problem using python and gurobi. If you are not in or have not yet taken INSY 3010 you may solve the problem using the excel solver (only if you have already met with me about adjusting assignments in this class to not use python and this must be clearly marked on your assignment). Submit your .py file on Canvas and include the optimal solution and what it means in the context of the problem, in your written submission. You need to buy a new cell phone now, and are trying to minimize your cell phone costs for the next 5 years. A new cell phone costs C dollars and lasts for at most 3 years. The estimated maintenance cost for a phone depends on its age - if a phone is in its ith year of life, the cost will be Mi dollars, i - 1,2,3. Assuming cell phones have no salvage value and that you have the option each year of buying a new phone (for C dollars), formulate a network model that will minimize your costs over the next 5 years. [Hint: it can be modeled a shortest path problem.] Problem data: 200 M1 20 M2- 10 M3 50