Identify the first edge that will be added to the result after executing Kruskal's minimum spanning tree algorithm.
1) fb
2) bg
3) cb
4) ab