What will be the time complexity of the brute force approach used to find the articulation points in a given graph?

For every vertex V, do: 
Remove V from the graph  
See if the graph remains connected 
If graph is disconnected, add V to the resultant set  
Add V back to the graph

A. O(V*(V + E))

B. O(V log V)

C. O(V + log V)

D. O(E log V)

Answer: Option A