9. Let A be the following DFA. When you minimize A using the table-filling algorithm, the following are the sets of indistinguishable (equivalent) states. (a) {A,C},{B,D,G},{E,F} (b) {A,C,E},{B,D,G},{F} (c) {A},{B,D,G},{C,E,F} (d) {A,E},{B,D,G},{C,F}