plz solve by using evolutionary algorithm in excel solver Planning a Tour. Recent graduate and world traveler Alastair Bor is planning a

European trip. He is influenced by his curiosity about urban culture in the EU and by his

study of international relations while he was in school. Accordingly, he has decided to

make one stop in each of twelve European capitals in the time he has available. The

distances between the capitals are shown below:

a$.$ What sequence achieves a minimum$-$distance tour of the cities, starting and ending

in Brussels? What is the length of the minimum$-$distance tour?

b$.$ Suppose that Alastair need not return to Brussels but can finish the tour in any of

the cities. What sequence achieves a minimum$-$distance path through all the cities,

starting in Brussels?