Maximise the bridges

Chef is given two integers $N$ and $M$. Please help Chef find any **connected undirected graph** $G$ consisting of exactly $N$ vertices and $M$ edges, such that the number of bridges in $G$ is **maximized** (among all graphs with $N$ vertices and $M$ edges). $G$ **cannot** have [self-loops](https://en.wikipedia.org/wiki/Loop_(graph_theory)) or [multiple edges](https://en.wikipedia.org/wiki/Multipl