Similarly, 
and hence 
can be marked since 
has been marked in the previous pass. Other pairs cannot be marked and the resulting table is shown below. By executing step 3 again we observe that no more pairs can be marked and hence the algorithm stops with this table as the final result.
and hence can be marked since has been marked in the previous pass. Other pairs cannot be marked and the resulting table is shown below. By executing step 3 again we observe that no more pairs can be marked and hence the algorithm stops with this table as the final result.
The unmarked pairs left in the table after execution of the algorithm are 
and 
implying 
and 
. Now, we merge 
& 
and 
& 
to have new states 
& 
, respectively.
Transitions are adjusted appropriately to obtain the following minimal DFA.
Figure 6
is a final state, since both & were final states. Similarly is a non-final state.