For the structure and analysis of transitions in a Markov chain, it is necessary to classify the states. Some states, after being visited once, are certain to be visited again, while some other states this may not to be case. States i and j are in the same communicating class if each state is accessible from the other, i.e., i-j. According to the diagram there are two communication classes. The answer is D.