Use distinguishing sets to prove the following statements.

$($a$)$ Every DFA for the language L$1=\{$w $|$ w contains the substring $100\}$ requires at least $4$ states.

$($b$)$ Every DFA for the language L$3=\{$w $|$ every even position of w is $0\}$ requires at least $3$ states.