In kruskals MST algorithm when applied to a graph with 24 vertices we have obtained connected components having sizes 3, 6, 7, 8. Using weighted union give all possible scenarios as well as the minimum and maximum number of possible operations needed to get an MST.