Plz see below graph
Here it satisfies all constraints 2n-2 edges. 2 edge-disjoint spanning trees.
Imp:->> (in addition to some graphs shown like above )All wheel graphs with odd no. of nodes satisfy above 2 given constraint of question.
And now elimnate options.
(I think for option B if they will tell minimum cut edge is atleast 3 then also it is true..plz verify But atleast 2 includes atleast 3)
All options are true except D due to presence of cut vertex.
Note:- Edge-disjoint path :- pair of nodes can be connected by 2 diffrent paths which dont have any shared edges.
Vertex-disjoint path;--pair of nodes can be connected by 2 diffrent paths which dont have any shared vertices(nodes).