Given an undirected graph G with m edges and n vertices, does G have a spanning tree with at most 2 leaves?

Determine either

a) if the problem is NP-Hard, or

b) Identify the smallest values k and l such that there is an O(m^k n^l poly(log(m), log(n)))) algorithm for this problem