1. Consider the Node Routing and Seheduling Problem with Time Windows example in TransportationProblemsPart4 Examples.pdf file. Given the following route, perform one more iteration and try inserting 1,2,3, and 6 to the existing route. Which node is inserted next? Show all your steps and as a summary, fill a table as the one below. You can eliminate some alternatives (e.g., visiting 3 before 4 was infeasible in the first iteration, it will still be infeasible) with reference to the first iteration we performed in the exercise (check the solution sheet)