can anyone help me with this question? The layout of a city with land masses and bridges is shown. Complete parts (a) and (b). An area has 3 islands on a river and two land masses above and below the river. The land mass above the river is labeled Upper C which has two bridges to a middle island labeled Upper D and an island to the right labeled Upper A. The land mass on the bottom of the river is labeled Upper E and has two bridges to the island on the left labeled Upper B, a bridge to island Upper D, and a bridge to island Upper A. Island Upper B has a bridge to island Upper D and island Upper D has a bridge to island Upper A. B D A C E a. Draw a graph the models the layout of the city. Use vertices to represent the land masses and edges to represent bridges. Choose the correct graph below. A. A graph has 5 vertices labeled A through E and 8 edges. The edges are as follows: Upper B Upper E, Upper B Upper C, Upper B Upper D, Upper D Upper E, Upper D Upper A, Upper D Upper C, Upper A Upper E, Upper A Upper C. E A B C D B. A graph has 5 vertices labeled A through E and 7 edges. The edges are as follows: Upper B Upper E, Upper B Upper D, Upper D Upper E, Upper D Upper A, Upper D Upper C, Upper A Upper E, Upper A Upper C. E A B C D C. A graph has 5 vertices labeled A through E and 8 edges. The edges are as follows: Upper B Upper E, Upper B Upper E, Upper B Upper D, Upper B Upper C, Upper D Upper E, Upper D Upper A, Upper D Upper C, Upper A Upper E, Upper A Upper C. E A B C D D. A graph has 5 vertices labeled A through E and 8 edges. The edges are as follows: Upper B Upper E, Upper B Upper E, Upper B Upper D, Upper D Upper E, Upper D Upper A, Upper D Upper C, Upper A Upper E, Upper A Upper C. E A B C D Your answer is correct. b. Use the graph from part (a) to determine if the city residents would be able to walk across all of the bridges without crossing the same bridge twice. Drag the correct answer into the target below, then, if a path exists, drag the vertex labels to the appropriate locations in the path. Does a path exist? If a path exists, it goes from B to to B to to C to to E to to