A legal string begins with from 1 to 3 a's, is followed by 0 or more b's, c's, or d's, and ends with at least one e. (5 each) Create a deterministic finite state machine to accept legal strings (and only legal strings).
Create a nondeterministic finite state machine to accept legal strings (and only legal strings).​

step-by-step explanation:

to determine whether a given function is even, we simply substitute x with -x in the expression. if the result after simplification is identical to the original equation, then the function is said to be even other wise odd.

f(-x) = (-x)^2 - (-x) + 8

      = x^2 + x +8

the resulting function is not identical to the original one;

f(-x) ≠ f(x)

therefore, f(x) is not an even function