I think a simple way will be to take all the binary strings of size 3 i.e. 000, 001, 010, 011, 100, 101, 110, 111 and check them in all in all the regular expressions. One can find that only D accepts all the string, leaving 100. So, D is the answer. All we need is one of the 7 binary strings that the expression does not accepts.
A does simply accepts 100 so not the answer,
B only accepts 101 so not the answer
C will not accepts 011, 111, etc
D is left, hence it is the answer.