Puppylover05
contestada

PLEASE HELP 100 POINTS!!

Mr. Williams needs his computer hooked up to every station in the school. Not every station is connected to every other station. The cost of connecting various stations is represented in the graph below. What is the cost of the minimum spanning tree using Kurskal's Algorithm?

A) 58
B) 60
C) 62
D) 64

PLEASE HELP 100 POINTS Mr Williams needs his computer hooked up to every station in the school Not every station is connected to every other station The cost of class=

Respuesta :

We need the diagonal of rectangle

  • AE=perpendicular=10=B
  • Base=EH=8+9+7=24=B

Hypotenuse be H

Apply Pythagorean theorem

[tex]\\ \rm\Rrightarrow H^2=P^2+B^2[/tex]

[tex]\\ \rm\Rrightarrow H^2=10^2+24^2[/tex]

[tex]\\ \rm\Rrightarrow H^2=26^2[/tex]

[tex]\\ \rm\Rrightarrow H=26[/tex]

Otras preguntas