You are given a DFA A which accepts some language L. Describe a method to build an automaton B (it can be an NFA) which accepts the language of all strings that begin with some string in L....

You are given a DFA A which accepts some language L. Describe a method to build an
automaton B (it can be an NFA) which accepts the language of all strings that begin with some string in
L. Demonstrate your construction on at least one non-trivial example.