DFA for Right Quotient of Regular Languages

Question

For drawing the DFA for right quotient I have referred following link:-

Ref :- https://www.seas.upenn.edu/~cit596/notes/dave/closure5.html

But unable to get the dfa for the following language

Its answer is  c, and got that too using manual checking. but facing difficulty in drawing DFA for it.

Answer 1

L1=bba*baa*

L2=(ab)*

L1/l2=bba*ba*

Now check DFA for that (if you face difficult create direct DFA then first create NFA and convert it into DFA(it also give minimal DFA))

Comments

You are probably doing

Step1> Manually finding Reg Exp.

Step2> Creating DFA for that Regular Expression.

But my question is, in the above ref link https://www.seas.upenn.edu/~cit596/notes/dave/closure5.html  they have provided an algorithm for drawing L1/L2 DFA directly. They are following steps as:-

Step1> Get the DFA of L1/L2.

Step2> Get the Reg expression from that DFA.