Given the following DFA with states {A, B, C, D, E, F}, minimize it using state minimization algorithm:

Start state: A

Final states: {D, F}

Transitions:

δ(A, 0) = B,  δ(A, 1) = C

δ(B, 0) = D,  δ(B, 1) = E

δ(C, 0) = E,  δ(C, 1) = D

δ(D, 0) = D,  δ(D, 1) = D

δ(E, 0) = F,  δ(E, 1) = F

δ(F, 0) = F,  δ(F, 1) = F

Show all steps clearly including partition refinement.