A vertex cover of a graph $G(V,E)$ is a set of vertices $S$ such that every edge

of $O$ has at least ene end point in $S.$ A tree is an undireeted comneeted

groph which doest't have any eycles. Given a tree $T$ on $n$ vertices as

inpet, give an efficient algorithm for finding size of a smallest sized vertex

cover for T$.$ Give formal pseudocode and analyze the time complexity of

the algorithm. Full credit will be given only for the correct algorithm

whose time complexity is asymplotically equal to the time complexity of

the best algonithm for the problem.