Let g be a connected, weighted graph, let v be a vertex in g, suppose that the weights of the edges incident on v are distinct let e be the edge of minimum weight incident on v must e be contained in every minimum spanning tree?

x is the total time in minutes for the free response

you are given number of questions as 15 - m and time per item as 8 minutes

to find x multiply the two givens together:

x = 8 * (15-m) = 8(15-m)

i believe it's a.

i'm not sure on this one, most likely correct.

we can't see all full 4 options, but if this is the full option, than the very left one is correct:

-2/5 * -3 3/4

remake the question, adding a picture of all the question, or write down the full left and right answers.