25. The cost of the last edge that Kruskal’s algorithm selects to be part of a minimal-cost spanning tree for the weighted graph below is _________.