ALL I NEED IS JUST PYTHON OR JAVA CODE FOR OPTION B. I DO NOT WANT ANY PSEUDOCODE. THANK YOU.

2. (40 pts) An Euler tour of a strongly connected, directed graph G=(V,E) is a cycle that traverses each edge of G exactly once, although it may visit a vertex more than once as shown below. a a b g f d H NO e H2 (a, g, c, b, g, e, d, f, a) a)(15 pts) Show that G has an Euler tour if and only if in-degree(v) = out-degree(v) for each vertex vEV. b)(25 pts) Describe and implement an O(E) time algorithm to find an Euler tour of G if one exists, write its code. Hint: Merge edge-disjoint cycles, you can solve this problem with just 10-15 lines of code