Answer:
The vertices of the feasible region are:
(0,1), (0,7) and (4,3).
Explanation:
We can observe the graph of the following Linear programming problem (LPP) to see which are the vertices of the feasible region.
We are given constraints as:

We observe that the common feasible region of these constraints is a triangle hence it will have three vertices.
The vertices of the triangle formed by the feasible region are:
(0,1), (0,7) and (4,3).