Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the number of componentsin the resultant graph must necessarily lie between.

A

k and n

B

k - 1 and k + 1

C

k - 1 and n - 1

D

k + 1 and n - k