Solve the VRP problem which contains $11$ nodes$($one depot and $10$ customers$)$ and their "pairwise air

distances," which are asymmetric. Here is the demand array of the problem. demand $=$

np$.$array$([0,78,95,54,61,30,22,15,38,42,34].$ I am going to go enter the distance matrix manually from

the excel f$,$le so you don't have to$.$ Suppose vehicle capacity is $150$ units. Node $0$ shows depot and each

vehicle should start and finish their tours at depot. $-$ Make sure that customer $6$ is visited after customer

$8($You may want to change the model$).$ Solve the problem using "route first cluster second" algorithm by

using nearest neighbor for the routing part. Note that the assumption of visiting customer $6$ after $8$ holds

here as well.