Consider the nodes described below, and note that the depot is located at node 0. Suppose we would like to solve this vehicle routing problem (VRP) using the savings algorithm, ignoring the capacity.

Consider the nodes described below, and note that the depot is located at node 0. Suppose we would like to solve this vehicle routing problem (VRP) using the savings algorithm, ignoring the capacity. Node 0 Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Node 7 4 4 Distance Node 0 Node 1 Node 2 Node 3 Node 4 Node 5 Node 6 Node 7 2.83 4 5 5.66 6.32 8 8.54 4.47 3.16 2.83 5.66 8.06 6 7.62 2.83 5.39 4.47 7.07 2 4.24 3 4.47 7.62 4.12 7 3.16 Find the shortest route using Clarke and Wright Algorithm? Draw and explain your steps to compute the route