Recall from the Graph Basics section that a graph in which there are multiple edges between the same pair of vertices is called a multigraph. The figure shows a map of the four bridges that link Staten Island to Brooklyn and New Jersey and a multigraph representing the map. In the multigraph, the edges are labeled instead of the vertices. The edges represent the bridges, \(G\) (Goethals Bridge), \(B\) (Bayonne Bridge), \(C\) (Outerbridge Crossing), and \(V\) (Verrazzano-Narrows Bridge). The vertices represent New Jersey, Staten Island, and Brooklyn.

A path can be named by a sequences of edges instead of a sequence of vertices. Determine which of the following sequence of edges is a walk.

a. \(B \rightarrow V \rightarrow C \rightarrow G \rightarrow C\)

b. \(\quad V \rightarrow C \rightarrow B \rightarrow G \rightarrow C\)

c. \(C \rightarrow V \rightarrow G \rightarrow B \rightarrow B\)

d. \(\quad G \rightarrow V \rightarrow B \rightarrow V \rightarrow C\)

New Jersey Goethals Bridge Bayonne Brooklyn Bridge Staten Island Verrazano Outerbridge Bridge Crossing Atlantic Ocean Map Multigraph Map and Multigraph of Staten Island Bridges