Q$3\mathrm{.}1$ Modified algorithm of Kruskal

$5$ Points

Consider the following graph.

For which of the following edge weights, assigned to the graph above, does the modified algorithm

of Kruskal provide a wrong result assuming that $k=4?$ Tick all answers for which this is the case.

$w(1,2)=4,w(2,3)=6,w(3,4)=5,w(4,5)=4$

$w(1,2)=6,w(2,3)=2,w(3,4)=3,w(4,5)=5$

$w(1,2)=2,w(2,3)=1,w(3,4)=3,w(4,5)=2$

$w(1,2)=1,w(2,3)=2,w(3,4)=3,w(4,5)=4$

Here, $w(a,b)=d$ means that the edge between vertices a and $b$ has weight $d.$