I need help ASAP PLease. I only need letter d-i, thanks!! 1. Design an eight-state finite-state machine to recognize int

[answerhappygod]

I need help ASAP PLease. I only need letter d-i, thanks!!
1. Design an eight-state finite-state machine to recognize
intruders using a security alarm system (Name it Machine M1). a)
Draw the state table or the state diagram (graph) for the machine.
b) List three (3) strings which would be accepted by the machine.
c) Write a function that implements the above finite-state machine.
(Do not write the entire program). d) Minimize the size of the
state set by computing the state equivalence relations. Hint: The
minimized machine must have four states. (Name it Machine M2) e)
Change one non-final state in the original eight-state machine
(Machine M1) into a final state. (Name it Machine M3) f) What is
the regular expression for the language accepted by Machine M3? g)
Redo the minimization in (e). (Name it Machine M4) h) How large
could the new state set be? How small could it be? (Machine M4) i)
Justify your answer.