Suppose that as a supervisor, you need to optimally assign drivers to different locations to deliver purchased stock to factories (i.e. four destinations) located in different states . The hours required to travel to each destination by each driver are given by:

	Destination 1	Destination 2	Destination 3	Destination 4
Driver 1	12	8	9	7
Driver 2	14	10	12	9
Driver 3	16	15	8	18
Driver 4	13	9	11	13

Assuming that as a supervisor you want to allocate drivers such that the total time is minimized, what is the optimal solution? Formulate the Linear Programming model and use the Solver tool to find the optimal solution and explain the final answer.

Suppose that Driver 3 is retiring, and the company just hired a younger driver who is more efficient and has reduced the hours to reach the Destinations 1, 2, 3 and 4 by 25%, 20%, 0% and by one-sixth of the magnitude, respectively. Formulate the Linear programming model and use the Solver tool to find the optimal solution and explain the final answer