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.
Answer:
madarchod Teri Ama ko puti
Answer:
she needs 10,900000
Explanation:
34.000 + 7,500 = 10,900000
a lightning stuck in-between them and the world split in half seperating them from eachother
explanation link: every4explaination.com