$5e^r$ in the interval $(-5,5).$ different cities. Find the shortest path from city $\text{'}$a$\text{'}$ to all other cities using Dijkstra's Algorithm.

$[12$M$]$