Which is the cost of the minimum spanning tree of the weighted graph using Kruskal's Algorithm? 28
30
31
40

9514 1404 393

  (a)  28

Step-by-step explanation:

Kruskal's algorithm has  you identify the shortest edge at each stage, including in the tree any identified edge that does not form a cycle. Here, we can start with AB, then add DF, EH, HG, BG, AC, CD and that covers the entire graph.

Starting at E, the node list is EHGBACDF. The cost is ...

  3 +4 +5 +1 +6 +7 +2 = 28

__

In the attached, the minimum-cost spanning tree is highlighted in red.

d. 24+-0.114

step-by-step explanation:

the question requires us to calculate the approximate 95% confidence interval for the mean number of ounces of ketchup per bottle in the sample given the following statistics;

sample mean = 24

standard deviation, σ = 0.4

sample size , n = 49

the confidence interval for a population mean is calculated using the formula;

sample mean ± z-score*(σ/sqrt(n))

the z-score associated with a 95% confidence interval, from the standard normal tables, is;

1.96

substituting these values into the formula;

24 ± 1.96*(0.4/7)

= 24 ± 0.112

from the alternatives given, choice d is closest to the above expression;