Question

Determine if the graph to the right is traversable.IDIs the graph traversablo? If so, determine a path that will traverse the graph Choose the correct answer below.OA. Yes, the path A, B, C, D, E, A, B, D, E, B will traverse the graphOB. Yes, the path C, B, A, D, E, C, D, A, E, B, D will traverse the graph,OC. Yos, the path A, B, C, E, D, A, E, B, D, C will traverse the graph,OD. Yes, the path C, D, B, E, D, A, C, B, D will traverse the graph,OE. No, the graph is not traversable.

Answer 1

A traversable graph is one you can draw without taking your pen off the paper, and without going over any edge twice.

We have to check the option that is the path given can be drawn without pen off and also without going over any edge twice.

1. The first path , A, B, C, D, E, A, B, D, E, B is clearly going over the edge DE twice.

Therefore , the path does not traversable the graph.

2. The second path C, B, A, D, E, C, D, A, E, B, D