Answer all parts please

Exercise 6.3.2: Implementing the algorithm to find an Euler circuit. About The algorithm to find an Euler circuit in a graph is applied to the graph below. b e h (a) At the beginning of an iteration, the cycle Cis (a, b, c, d, h, i, a ). Draw the graph G' for this iteration. (b) Which vertices are candidates to play the role of w in this iteration? ) Select a vertex for w. Then use the algorithm for finding a circuit in a graph to find a circuit C'in G', starting the vertex you selected for w (d Use your choice for C' to find the circuit C for the next iteration. () Complete the algorithm to find an Euler circuit. For each iteration, give the graph G', the choice for w, the circuit C' that starts at W, and the circuit C for the next iteration. Give the final Euler circuit produced by the algorithm