Describe the algorithmic steps required to build a backtracking Regular Expression engine. Explain how to convert a regex pattern into a Non-deterministic Finite Automaton (NFA) and then how the engine traverses this NFA to find matches. Specifically, address the handling of backreferences, lazy quantifiers, and the potential for catastrophic backtracking, suggesting ways to mitigate such issues.