Show that the following language is regular: {w {0, 1} there is a way to insert the substring 011 (once) into w so that the result is a multiple of 3 in binary }

Example: The string w = 1011 should be accepted since 1010111bin = 87dec, a multiple of 3. The string w = 1000 should not be accepted since none of the following are multiples of 3: {0111000, 1011000, 1001100, 1000110, 1000011}