use the language operations (repetition, union, and concatenation). construct an NFA that realizes the language L over the alphabet {a, b, c} that consists of all strings that are either abc repeated...

use the language operations (repetition, union, and concatenation). construct an NFA that realizes the language L over the alphabet {a, b, c} that consists of all strings that are either abc repeated any number of times, or an even length string with no as and ending in bc