(a) Describe the process for converting a deterministic finite-state automaton $D$ into a regular expression $R$ defining the same language, $\mathcal{L}(D)=\mathcal{L}(R)$. [You need only outline the steps, without proof, but you should clearly define all terminology you introduce.]

(b) Consider the language $L$ over the alphabet $\{0,1\}$ defined via

$$L:=\left\{w 01^{n} \mid w \in\{0,1\}^{*}, n \in \mathbb{K}\right\} \cup\{1\}^{*} .$$

Show that $L$ satisfies the pumping lemma for regular languages but is not a regular language itself.