Question is add minimum number of edges so that this given graph consists an eulerian path (but not necessarily an eulerian circuit). Why do edges less than these given edges won't suffice?
As I solved this question, it turns out that an eulerian path can exist by removing more than one edge. Does it work as a contradiction? Or is it possible to add more edges in the graph to get the result?
Here's my solution with series of vertex showing that an eulerian circuit can exist by removing edges.