yes you are right since L={w1aw2} where length of w1( |w1| ) >= 3 and length of w2( |w2| ) <= 5
so in this dfa 1st condition |w1| is followed upto state q3 it will accept all strings having |w1|>=3
2nd condition is |w2| <= 5 so q4 is accepting state since |w2| can be 0 also q21,q22,q23,q24 are accepting states also
since |w2| canbe 1,2,3.4 respectively but it is wrong at state q5 since it should also be accepting since condition is |w2|<=5
means |w2| can be 5 so q5 also be accepting and also there should be an extra state which will act as dead state name it
q6.
dead state - state telling dfa not to accept strings ending computation at this state.
q0,q1,q2,q3 arev also dead states