Given the following deterministic FSM M over the alphabet = {0, 1}: $1 0 0 0 1 (a) Give an English language description of L(M), the language recognised by M. (b) Add an error state (labelled X) to the diagram, and draw all transitions to it. (c) Describe how to derive an FSM that accepts the complement of L(M) over the set *. (That is, an FSM that accepts the language E*- L(M).) (d) Give a regular expression for the complement of L(M).