discrete structures, trees and 2-connected graphs

Prove for every tree T with n3 vertices of which k2 are leaves, that the tree can be made made into a 2connected graph by adding at most k1 edges. Hint A good way to write a proof like this is to first clearly describe which edges you add and then proving that the result is a 2-connected graph