Answer
The first graph has a Euler path
The second graph does not have an Euler path
Work Step by Step
The first graph:
Exactly two vertices have odd degree (B and C), so an Euler path exists.The first graph has a Euler path: B->A->C->B->D->C
The second graph:
Because more than two vertices have odd degree (here four), no Euler path exists for this graph.
