Oluwagbemisola J OluwagbirP Find -aBbCcD AaBbCcD AaBbCcD AaBbCcD AaBbCcD AaBbCcD AaBbCcD AABBCCDD AABBCCDE AaBbCcDab. ReplaceSubtitleSubtle Em. EmphasisIntense E.StrongQuoteIntense Q. Subtle Ref.. Intense Re. Book TitleA Select -StylesEditing10.A city is planning their snow plow route for next winter. They want to begin atthe garage, go down each street only once, and end at the garage. Whichgraph would be best for this scenario?A. Euler circuito B. Euler graphC. Hamiltonian circuitD. Hamiltonian graph11.Elizabeth is planning a trip. She wants to fly out of Charlotte, visit New York,visit Hollywood, and end up at her parent's home in Dallas. Which graph wouldbe best for this scenario?A. Hamiltonian pathB. Hamiltonian circuitC. Euler pathD. Euler circuit12.Bob has to check the stop signs at every intersection in his hometown. He parkshis car in the parking lot of the transportation department and needs to end upback at his car. He only wants to check each intersection one time. Whichgraph would be best for this scenario?A. Hamiltonian circuitB. Hamiltonian pathC. Euler pathD. Euler circuit13.Roberta wants to deliver the mail. She begins at the Post Office where shepicks up the mail each day, but wants to end close to her home. She only wantsto go down each street once. Her home is 5 miles from the Post Office. Whichgraph would best meet this scenario?A. Euler pathB. Euler circuitC. Hamiltonian pathD. Hamiltonian circuit62°F Mostly cl.. m* AP ) 7:11 PMnic

Remark: Euler path and Euler circuit: An Euler path is a path that uses every edge of a graph exactly once but may repeat vertices . An Euler circuit is a circuit that uses every edge of a graph exactly once but may repeat vertices. Euler Graph - A connected graph G is called an Euler graph, if there is a closed trail which includes every edge of the graph G. Hamiltonian circuit: A Hamiltonian circuit in a graph is a closed path that visits every vertex in the graph exactly once. Hamiltonian Graph: If a graph has a Hamiltonian circuit, then the graph is called a Hamiltonian graph. 10. Here street represents edges. So the correct answer is B. Euler graph. 11. Here the city represents vertices. Answer is A. Hamiltonian path. 12. Here each intersection represents vertices. Answer is A. Hamiltonian circuit. 13. As she wants to go down each street once, so the correct answer is A. Euler path.