The Steiner tree problem is as follows. Given G $=($V$,$ E$)$ with positive edge weights, and whose vertices are partitioned into two sets R $($required$)$ and S $($Steiner$),$ find a minimum cost tree in G that contains all required vertices. Design a $2-$approximation algorithm for the Steiner tree problem.