We say that state q of a deterministic finite automaton M = (K, ,, qo, F)

is reachable if there exists W * such that (qo, w) *M (q, e). Show that if we delete from M any nonreachable state, an automaton results that accepts the same language. Give an efficient algorithm for computing the set of all reachable states of a deterministic finite automaton. Implement this problem using FSM (Dr.Racket).