Is my langauge for the question above correct? How would you do it?

II) Consider the set of Strings on {0,}. For each, construct an accepting DFA such that, a) All strings that contain substing 000, but not 0000 . b) The leftmost symbol differs from the rightmost. a) L={w:w{000}w/{0000}}