Finite automaton that recognizes the empty language $\emptyset$ Since the language $L = \emptyset$ is regular, there must be a finite automaton that recognizes it.  However, I'm not exactly sure how one would be constructed.  I feel like the answer is trivial.  Can someone help me out?

You have only one state $s$ that is initial, but not accepting with loops $s \overset{\alpha}{\rightarrow} s$ for any letter $\alpha \in \Sigma$ (with non-deterministic automaton you can even skip the loops, i.e. the transition relation would be empty).
I hope this helps ;-)
