YOU CAN SOLVE THIS QUESTIONS IN MANY APPROACHES(FEW ARE THESE):
1:USE STATE ELIMINATION METHOD (CONVERTING FA TO REGULAR EXPRESSIONS)
2.MINIMISE THE DFA AND CHECK THE OPTION WHICH POINT TO SAME LANGUAGE.
3.YOU CAN USE HIT AND TRAIL APPROACH BY CHECKING THE OPTIONS AND POINTING OUT FEW STRINGS NOT POSSIBLE AND RULING THE OPTION OUT.
THE PROBLEM WITH 2 AND 3 APPROACH IS THAT THERE IS "NONE OF THE ABOVE"OPTION" AND YOU HAVE TO BE VERY SURE ABOUT IT WHILE CHOOSING ANY OPTIONS.
FOR SUCH CASE GO FOR 1ST APPROACH AS IT WILL LEAD TO YOU TO ACCURATE ANSWER.