convert this DFA to GNFA and then to regular expression. ( hint: it accepts words ending in 00 or 11)

text description of above DFA:

initial state : q0

final states : q3, q4

states overall: q0,q1,q2,q3,q4

(q0,0) = q1

(q0,1) = q2

(q1,0) = q3

(q1,1) = q2

(q2,0) = q1

(q2,1) = q4

(q3,0) = q3

(q3,1) = q2

(q4,1) = q4

(q4,0) = q1