56. Eulerize the accompanying graph by using four new edges. Find an Euler circuit in the eulerized graph and use that circuit to find a circuit of the original graph that covers all edges but reuses edges only four times. How many different ways can the four edges be chosen? What is the total number of edges in the Euler circuit in the eulerized graph?