Answer
(a) please see graph below
(b) Since this graph has at least one Euler path, we can establish a route so that the security guard will be able to walk each street exactly once.
The security guard must start walking either at vertex B or vertex E.
Work Step by Step
(a) please see graph below
(b) We need to determine if this graph has an Euler path.
According to Euler's theorem, for a graph to have at least one Euler path, the number of odd vertices must be either 0 or 2. On this graph, vertex B, and vertex E are odd vertices. The other vertices are even vertices. This graph has exactly two odd vertices. Therefore, according to Euler's theorem, this graph has an Euler path.
An Euler path is a path that travels through each edge on the graph exactly once. Since this graph has at least one Euler path, the security guard will be able to walk each street exactly once.
When a graph has exactly two odd vertices, any Euler path starts at one odd vertex and ends at the other odd vertex. The security guard must start walking either at vertex B or vertex E.
