Prove, that the Steiner Tree problem, (finding shortest tree connecting n points in the plane) is in class NP a)Optimization formulation b)Decision formulation c)Polynomial-size certificate d)Polynomial time verification algorithm