could you use python3 to solve it

Question 3: Vertex Cover (4 points) A graph is represented by the set of vertices V and the set of edges E.For example, the following graph 1 2 5 3 4 is represented by v-(1, 2. 3.4.5) and E-(.2). (2.3), (1.), (3.). (4.5) A subset s of V is said to be a vertex cover it for each edge (a. b) in E, where a For example, each of the following is a vertex cover of the graph G t.24. ...2.4.s). and b are vertices, either a is in s or b is ins of G: (1.2,3). 14.5). 11.4 For example, each of the following is a vertex cover of the graph G (1,2,4) 1,3,4, (1.2,4.5), (1.3,4.5). (1.3,5), (2.3.4 Each of the following is not a vertex cover of G: (1,2,3) 4,5) 1. 4, 5) Write a python function vertex cover (E. s) that takes the set of edges E and a set of vertices s. The function returns True if s is a vertex graph formed by the vertices and edges in E, otherwise it returns False. Assume that S is a subset of the set of vertices appear in E def vertex cover (E, S): # Your code here L 1: vertex c over (I(1,2), (2, 3), (2, 4). (3, 1), (4.5)), (2, 3, 4)) True n:vertex. cover (((1,2). (2.3), (2,4). (3, 1). (4.5), (2.4) False