Suppose we are given an undirected weighted graph G = (V, E) modeling the road network between n = |V | cities. Specifically, each node vi V represents a city. If there is an edge e = (vi , vj ) E, then there is a road between city vi and vj , and the weight weight(e) represents the time it takes to go from city vi to vj on this road. We also refer to each edge in E as one road segment. The total number of road segments (i.e, edges) is m = |E|.

(7.a) Given a fixed city vs, suppose Alex wants to travel to only cities that are within k number of road segments. Write the pseudocode of an algorithm that outputs these cities. Give the running time of your algorithm.