draw picture for Let A be a regular language. DROPOUT

$($

A

$)$

$$is the language containing all strings that can be obtained by dropping one symbol from a string in A

$.$

$$DROPOUT

$($

A

$)$

$=$

$\{$

xz

$|$

$$xyz in A

$,$

$$where x

$,$

z in

$\backslash$

Sigma

$*$

$,$

$$y in

$\backslash$

Sigma

$\}$

$.$

$$How to prove that dropout

$($

A

$)$

$$is a regular language?