Turing Machines Exercise

Give an NFA or DFA that accepts the language: L()



Σ:
Γ: