Kruskal's algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest.
Here, in this problem least possible weight is 2, AE.
Answer: AE