Using Kruskal's Algorithm, which of the following edges of the given graph are NOT part of the minimal spanning tree ?

b.) 160 miles on a 5 gallons car

step-by-step explanation:

240/10=24 miles/gallon

160/5=32 miles/gallon

30/1=30 miles/gallon

168/6= 28 miles/gallon

32 miles/gallon is the most amount, so this is the best.

the first dot plot best represents the data

plzplzplzplz mark brainliest and have a good day

sup

step-by-step explanation:

a.) list the factors of 40.

1/2/4/5/8/10/20/40

b.) list the factors of 40 that represent the number of cans that could be on each shelf.

5

c.) how many different arrangements of cans are possible?

just one because if you put more on one shelf you will go way over 40 and the cabinet will probably break.

d.) what are the possible arrangements of the cans?

put 5 cans on each self to reach 40 cans in total.

e.) which arrangement uses all the shelves?

5 because you can put 5 cans on each shelf, and since there are 8 shelfs you are equally going to get 40 cans.