Solve using Dijkstra's algorithm. Answer with BOTH pseudocode and the running time.

The graph above represents a number of towns connected by roads. Each road is labeled by how long it would take for a fire engine to travel to it. Each intersection is labeled with a circle. Suppose you wanted to find one "optimal" location to place a fire station such that it minimizes the time to the farthest destination. Come up with an algorithm to solve this problem when using an arbitrary road map. Give the running time when there are f possible locations for the fire station (which must be at one of the intersections) and r possible roads.

3 2 9 2