I think ans is 1 (A)
In Kruskal's algorithm the safe edge added to A (subset of a MST) is always a least weight edge in the graph that connects two distinct components. So, if there are negative weight edges they will not affect the evolution of the algorithm.