How many strings of length 5 or less does M accept? (Produce the accepted strings, then count.) Answer Check The following questions ask you to construct finite automata. Draw the automaton in the provided box. If the sam transition can be taken under two or more symbols, list the symbols separated by vertical bars in the transition's label. For example, the label e|1 indicates that a transition can be taken under 0 or under 1. Any spaces in a transition label will be ignored. Please use the Precheck button to partially check your automaton before submitting it to a question using the Check button. A precheck attracts no marks and no penalty; you can use it any number of times and also after incorrect submissions. If your representation fails the precheck, it will falil the full check as well. If it passes the precheck, it may or may not pass the full check. Construct a DFA which accepts those strings over =(0,1) that contain at least three 0-symbols (and does not accept any other strings; this is an implicit assumption for such questions). of Answer: (penalty regime: 10, 20,.. Help