Design a NFA over Σ = {a , b , c} to accept the following language: L = {(ab)n (abo)m : n 0, m 0} over Σ = {a , b , c} Example of L = {ab, abc, aba bc, abab, ababcabc, Example of L= {a, b, ba, abb, aab, abccbbbb, ) )

Design a NFA over Σ = {a , b , c} to accept the following language: L = {(ab)n (abo)m : n 0, m 0} over Σ = {a , b , c} Example of L = {ab, abc, aba bc, abab, ababcabc, Example of L= {a, b, ba, abb, aab, abccbbbb, ) ) Show transcribed image text