Write regular expression for a language which generates binary numbers in the form of any number of zeros and ones followed by a pair of zeros followed by any number of zeros and ones. For example, 00, 010100110, 0001, and 11100 are in this language. But, 10101 or 010 are not in the language.