Let $G(V,E)$ be a weighted complete graph with $V$ vertices and $E$ edges, as shown in Figure $2.$ Initially

three vehicles are placed on the locations A$,$ B and D$.$ Edges reprsent the cost between two locations

$($iiike travei cost from $A-B$ is $9).$

The request of vehicle raised from the sequence of locations are: C$,$ E$,$ D$,$ A$,$ E$,$ C$,$ D$,$ B$.$

Calculate the total minimal cost after completion of all the requests.