For the automaton below, apply the minimization algorithm step by step.

Indicate the initial partitioning of the states, e.g.:

initial partitioning: {{0,3},{1,2,4}}

For every step, indicate

the source partition (e.g. {1,2,4}) you are splitting,

the input letter (e.g. b),

the target partition (e.g. {0,3}) you consider, and

the resulting partitioning ({{0,3},{1,4},{2}}) after the split.

We consider the following automaton: This automaton can be visualized as follows (if the visualisation is not readable or incorrect, see the textual description above)