Give a DFA accepting all strings over $\{0,1\}$ that contain $00$ and $101$ as substrings, in that order, but possibly separated by and surrounded by arbitrary combinations of characters.

For each state in your automaton, give a brief description of the strings associated with that state.