Pls help

7. (5 points) Consider the following theorem having nrem. Suppose M = having n states. Suppose is non empty and all states of M are states. Then M accepts at least one string of length 2n rem. Suppose M = (K, ,83, F) is a deterministic finite automaton a) Is the theorem correct? Vo is ibi f the theorem is correct, give a prof, otherwse state why the theorem