Show what Prim's algorithm will do for the graph G = (V, E) with source vertex s. V= {s, a, b, c, d, e, f, g, h, I} Edges - costs are indicated next to the edge in (parenthesis) E = {sa (10), sb (5), sc (3), ah(2), ae(2), bc(1), be(2), ce(1), de(10), dg(3), ef(10), eg(3), fI(5), gh(3), hl(8)} Show the step by step growth of the tree in red