I think
1) Vertex connectivity = 2 Example: {v3,v4} is a vertex-set
2) Edge connectivity = 2 (Since the minimum degree of a vertex is 2, edge-connectity <= 2. Here edge-connectivity of 1 is not possible)
3) It is not a seperable graph because vertex connectivity is not 1.
4) {v1,v2,v5} is not a vertex-set because on removal of them,still the graph remains connected .