Answer:
I will show that this language is regular because it can be described by a regular expression and a FA (NFA)
Explanation:
The regular expression for the language is: (1⁺0*1⁺)* + (0⁺1*0⁺)*
NFA and DFA diagram chat that show that L2 is a regular language as shown below. at every loop, the language L2 comfortably repeats itself.
I will defeat you yelled the man too
Answer: Make a connection to your life from getting bullied or what ever happened to her.
<span>I think it can be interpreted differently because some people think in different ways, and when something is written differently it can have a change in perception.</span>