Finding minimum number of edges such that when adding into the graph, the graph is a 2-connected graph
$2$-connectedness is the same as bridgeless.

So $M$ must be the set of bridges in $G$ no matter how large or small their sum is.