Relation RM ='all states are reachable from the start state'
only 3 states required including dead state.
Let q0 be a start state and q2 is dead state
δ:Q×Σ→Q which implies q0 x {0,1} → {q0 , q1, q2)
δ(q0,0)=q0==>for 0* reached to q0 (qo to q0)
δ(q0,1)=q1==>for 0*1 reached to q1 (q0 to q1)
δ(q1,0)=q1==>for 0*10* reached to q1 (q0 to q1)
δ(q1,1)=q2==>for 0*10*1 reached to q2 (q0 to q2)
δ(q2,0)=q2==>for 0*10*10* reached to q2 (q0 to q2)
δ(q2,1)=q2==>for 0*10*11* reached to q2 (q0 to q2)
Hence, There are 6 equivalence classes