Professor and the money heist crew are planning their escape. But to plan the escape they need to navigate the city from the Bank of Spain in Madrid to their safehouse at location d. So they need your help to devise an algorithm they can use to escape. Now the city is in the form of a graph. The roads are edges and each junction were two or more roads meet is a node. So there are N junctions or nodes M bidirectional roads or edges, to travel through ith road it takes Profesor ti time. There are police stations in the city as soon as they are informed the forces from the stations go to the junctions. Now Profesor wants to know the least amount of time in which he can reach the safe house after completing the heist. Note: Police can intercept them only at the junctions. First of all, it is important to have algorithm to this task.

Secondly, Code in C++ to this task, and indicate input to check the output of the code. Finally, time-complexity of the code