Determine whether the graph has a euler path or circuit?

question 1 options:

euler path

euler circuit

neither

not traceable

question 2 (1 point)

to create a euler path, we can start at

question 2 options:

vertex a and end at vertex e

vertex d and end at vertex b

vertex c and end at vertex c

vertex b and end at vertex b
question 3 (1 point)

to find the minimal spanning tree using kruskal’s algorithm, we can start with what edge?
question 3 options:

ac

ae

cd

ad

question 4 (1 point)

a railroad system connecting five cities is being planned. the goal is to build this system using the least amount of money, while ensuring each city can be reached by any other city in the system. the graph below gives estimates for the cost, in hundreds of thousands of dollars, to build a railroad between any two cities. what rail system leads to the lowest construction cost? use kruskal’s algorithm.

question 4 options:

a

a or c

a or b

b or c

question 5 (1 point)

use the flow chart to find z when x = 9
question 5 options:

170

180

200

29