The minimum cost spanning tree for the following graph has the cost __________.

To find the minimum cost spanning tree, we use Kruskal's algorithm by selecting edges in increasing order of weight without forming cycles.

1. Edge (1, 3) with weight 2 is selected.

2. Edge (4, 6) with weight 3 is selected.

3. Edge (2, 5) with weight 4 is selected.

4. Edge (3, 6) with weight 5 is selected.

5. Edge (2, 3) with weight 6 is selected to connect the remaining component {2, 5}.

Total Cost = 2 + 3 + 4 + 5 + 6 = 20.