GP is a package delivery company. GP has to visit 8 different customer locations. Based on past experience, GP forecasts the demand values. The depot is the starting point and has zero demand. The demand data is given in Table 1 and the distance matrix in Table 2. In one vehicle, GP can carry at most 30 units. Apply nearest neighbor heuristic to find the best route(s). Based on your solution, including routes, capacity usages, route lengths and the total route length in kilometers, choose the option with correct routes.

Table 1: The demand units Table 2: The distance and saving matrices (in kilometers) a) Distances D-3-4-1-2-D;D-8-6-7-5-DD-5-4-3-2-D;D-1-6-7-8-DD-3-4-1-2-6-8-7-5-DD-5-4-3-2-1-6-7-8-D