Page of 3 0 - ZOOM + Exercise 1.2. . The power exmpany needs to lay updated distribution lines connecting the ten Oregon citics below to the power grid. How can they minimize the amount of new linc to lay? Astoria Ashland Astoria Bend Corvulis Crater Lake Eugene Newport Portland Salcm Seaside 374 200 223 178 252 285 285 240 350 374 255 166 200 255 128 223 166 128 108 133 277 130 153 478 314 178 199 128 47 252 135 180 52 285 95 160 84 344 110 114 240 136 131 40 356 17 247 155 423 117 SE35 Crater Lake ES5555 Eugene ELE: Newport 2 Portland 5 & 2 BEE & Salem ZE ZEES = Seaside a.) Using Kruskal's algorithm to find a minimum cost spanning tree. b.) Solve this problem using Python's networkx package. 2 Page of 3 0 - ZOOM + Exercise 1.2. . The power exmpany needs to lay updated distribution lines connecting the ten Oregon citics below to the power grid. How can they minimize the amount of new linc to lay? Astoria Ashland Astoria Bend Corvulis Crater Lake Eugene Newport Portland Salcm Seaside 374 200 223 178 252 285 285 240 350 374 255 166 200 255 128 223 166 128 108 133 277 130 153 478 314 178 199 128 47 252 135 180 52 285 95 160 84 344 110 114 240 136 131 40 356 17 247 155 423 117 SE35 Crater Lake ES5555 Eugene ELE: Newport 2 Portland 5 & 2 BEE & Salem ZE ZEES = Seaside a.) Using Kruskal's algorithm to find a minimum cost spanning tree. b.) Solve this problem using Python's networkx package. 2