I think there are only 2 mst possible with min weight 6,7 so answer will be 7this question gets to many view just due to wrong interpretaion of question i.e. what actually asking in question is confusing means should we apply mst algo or not like this confusion .
Answer should be 1, 2 and 4… Why? Given that its complete graph so we will have cycle for sure as soon as we add 3rd edge.. now there are many graphs possible….First draw 2 edges...which least weights(1 and 2 ) note we cannot have cycle with 2 edges but if we add 3rd we will have cycle...now add the 3rd edge such a way the next minimum which weight edge which is 3 in our case forms a cycle..next possible least weight edge would be 4...and includes all vertex..
The Best possible arrangement which can give minimum cost spanning tree with maximum weight is
Which gives weight as 1 + 2 + 4 = 7
64.3k questions
77.9k answers
244k comments
80.0k users