Which is the cost of a minimum spanning tree of the weighted graph using Kurskal's Algorithm?

answer:

step-by-step explanation:

here, the total dishes = 10

dishes having meat = 3 ( chicken, meatloaf and hamburger )

thus, the probability of having meat on the chosen dishes = number of dishes having meat / total dishes

=

therefore, the probability of not having meat = 1- the probability of having meat on the chosen dishes

=

=

=

⇒ option b is correct.

if you are looking for the unit rate then the answer would be 9 because unit rate is distance divided by time.

step-by-step explanation: