The first thing is 'A graph(simple, connected) containing same number of edges as of vertices would for sure have just one cycle of length 3 or more..so to tell max number of spanning trees with n edge and n vertices graph we can take counter example as
Graph that is cycle of length 3(e=3,v=3) =>3 spanning tree
Graph that is cycle of length 4 (e=4,v=4)=> 4 spanning tree....
So answer would be 'n'.....