Consider an NFA on n states. Is it possible to determine whether it is empty in poly(n) time?

Suppose the NFA above has an equivalent DFA on d states. Is it possible to construct this DFA in poly(n,d) time?