Imagine that I have an NFA with $5$ states. If I use the subset construction to convert the NFA to an equivalent DFA, how many states will there be$,$ assuming I do not remove any unreachable states? Is it possible that there is a DFA with the same language that has fewer states or more states than the number you gave? Briefly justify why or why not.