how do I reduce this spanning tree problem to np-completeness?

Question

I have the following algorithmic problem:

If I have a graph G=(V,E), does G have a spanning tree with k leaves? Leaves being a vertex with only one neighbor in the sp