If a NFA contains N states, then Equivalent DFA can have atmost $2^N$ states.Is there any method or any concept to know, how many final and non-final states will be there in the equivalent DFA ?Take for example : An NFA has 7 states out of which 3 are final states. Its equivalent DFA can have atmost 128 states.Then is there any method to find maximum number of final states and non final states in converted equivalent DFA ? 
How to know maximum final states in a DFA?
automata;finite automata