NDFA associated with language L Let A = $(Q, \Sigma, \delta, S, F)$ be a deterministic finite automaton associated with the language
$L \subseteq \Sigma^*$

$L' = \{y \in \Sigma^*:\exists x\in L. |x| = |y|\}$
$L \subseteq L'$

How do I show that there exist a NDFA associated with L' ?
Hint: Replace every transition labelled $a \in \Sigma$ with a transition labelled $\Sigma$.