Consider a base language B={01,10}, now from B a new language is constructed in which every 0 can be replaced with 010 and every 10 can be replaced with 100. Which of the following regular expression represents the resulting language?
Explanation is appreciated