Show that the following language is regular: {w ? {0, 1} * thereis a way to insert the substring 011

Show that the following language is regular: {w ∈ {0, 1} ∗ thereis a way to insert the substring 011 (once) into w so that theresult 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 beaccepted since none of the following are multiples of 3:{
0111000, 1
011000,10
01100, 100
0110,1000
011} Attached