Please give a Regular Expression in Computer Science

The language L of all binary strings where every pair of consecutive 1s is immediately preceded by at least two Os. For example, the string 0011010001101 belongs to L because, as the underlined substrings show, each pair of consecutive 1s is preceded by two or more Os. The strings 00101101 and 001100011101 do not belong to this language because both contain a pair of consecutive 1s where the two immediately preceding characters include another 1