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?

One state, non-accepting, and no transitions. (That’s an NFA; if you want a DFA, have one transition from the state to itself for each letter of whatever alphabet is specified.)
