Prоblem 2. IP Mоdeling fоr Shortest Pаth with Opening Time. (30pts) A shipping compаny hаs started a new service for its clients where delivery will be completed within 12 hours. Now it tries to find the fastest path from Atlanta to Washington D.C. In order to prevent fatigue of drivers, there are several stops (locations) where the driver would be replaced by a new driver such that each driver only drives between one location and its next stop along the path. However, the assignment of the driver at each location can only be made when the truck arrives at the stop and the new driver cannot be assigned before some specific time as shown in table 1. Table 2 represents the network with all of the driver’s possible stops as well as the traveling time between each pair of these locations. Please model this problem as a shortest path IP. (Draw the network digraph, carefully define the parameters and variables, and then write down the IP formulation)