Analyze each graph below to determine whether it has an Euler circuit and/or an Euler trail. If it has an Euler circuit, specify the nodes for one. If it does not have an Euler circuit, justify why it does not. If it has an Euler trail, specify the nodes for one. If it does not have an Euler trail, justify why it does not. b C d (a) a f Figure 6: An undirected graph has 6 vertices, a through f. There are 8-line segments that are between the following vertices: a and b, a and c, a and d, a and f, b and c, b and e, b and f, d and e.