157 Euleriting and Semi-Eulerizing Graphs e point, you will have to pass through a mini- ways to do it using just 28 blocks, but none consisting of 40 and a route noint, 10. (5 points) Use Fleury's algorithm to find an Euler path in the graph on the left below. (You may use the graph on the right below as your yet-to-be-traveled graph). Start at vertex A and end at vertex B. Show your answer by labeling the edges 1,2,3, and so on in the order in which they are traveled. 11. (2 points cach)