(Solved): 8 Consider a scenario where five different cities are connected in the manner given below. Each ...

8 Consider a scenario where five different cities are connected in the manner given below. Each edge shows the distance between two cities. Use Djkstra's Algorithm to find the minimum path in which a postman can visit all the cities exactly once. Show each step of Djkstra's Algorithm. Consider each edge as a bidirectional edge here.