Use Prim's algorithm to find a minimum spanning tree for the following weighted graph.

Explain the algorithm$/$work step by step.

Manhattan

$$

$25$

Dyer

Oasis

$10$

Deep Springs

g$0$

$$

$20$

Silver Pea nO$,$

$25$

$$ Lida

$12$

$30$

Gold

Point

$55$

Tonopah

Warm Springs

$$ Goldfield

$70$

Beatty