Problem $1$

Let M be the following deterministic finite automata.

a$)$ Use a configuration trace to show that M accepts $w=10111100$

b$)$ Use a configuration trace to show that M rejects $w=11101$

c$)$ Describe the patterns of the strings accepted by M$.$