Consider the 5-state DFA accepting the language shown below. For any string let be the number of 0's in and be the number of 1's in .
Which of the following statements is/are FALSE?

- AStates 2 and 4 are distinguishable in
- BStates 3 and 4 are distinguishable in
- CStates 2 and 5 are distinguishable in
- DAny string with is in

