I have a question, and there is already a solution to it. But I want to write step by step each step to explain to me why we are doing that. The Solution is 100% right. I just need step by step explanation. Please explain each step I really do not know anything here.

4. Construct a regular expression over the alphabet {a,b} for the language accepted by the following automaton: LA=bLcLB=aLALC=MbLBbLCLxLC=bLcbLBLemm Put LB=aLA into Lc Lc=b(baLA) Plug Lc into LA LA=bb(baLA)lemma A=(bbba) A is the initial state The languge accepted by this automaton is A LA=(bbba)/2