Define the avoid operation for languages A and B to be

A avoid and $w$ does not contain any string in B as a substring$\}$

Prove: if A and $B$ are both regular languages, then A avoid $B$ is regular.

$($Hint: consider showing the language contains some string in $B$ as a substring