41. Find an Euler circuit on the eulerized graph (b) of the accompanying figure. Use it to find a circuit on the original graph (a) that covers all edges and reuses edges only five times. Can fewer than five reused edges be achieved?