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

yeet

step-by-step explanation:

answer: 94

step-by-step explanation: 79+91+92+94+94 = 450 divided by 5 (since there are 5 number that are being added) = 90

5x + 3y = - 4

step-by-step explanation:

the equation of a line in standard form is

ax + by = c ( a is a positive integer and b, c are integers )

express the line first of all in slope- intercept form

y = mx + c ( m is the slope and c the y-intercept )

to calculate m use the gradient formula

m = ( y₂ - y₁ ) / ( x₂ - x₁ )

with (x₁, y₁ ) = (7, - 3) and (x₂, y₂ ) = (4, - 8)

m = = -

y = - x + c ← is the partial equation

to find c substitute either of the 2 points into the partial equation

using (4, - 8 ), then

- 8 = - + c ⇒ c = -

y = - x - ← in slope-intercept form

multiply all terms by 3 to eliminate the fractions

3y = - 5x - 4 ( add 5x to both sides )

5x + 3y = - 4 ← in standard form

the answer i believe is 27 units.

step-by-step explanation: