How you can convert epsilon nfa to dfa?

To convert an epsilon nfa to a dfa you need to do an intermediate step.

We know:

Regular expression > epsilon nfa > nfa > DFA

We cannot skip steps here.

To convert an epsilon nfa to an nfa, first you need to make a transition table for the epsilon nfa. In the transition table, just do not include the epsilons, meaning only transitions to sets of states. Also remember that you can use epsilon transitions, however an input must be consumed as well to move to another state. As well all states that can be reached only by epsilon transitions become final states.

After you have the resulting transition table for the nfa, you can now make a dfa. All sets of states that are reachable in the nfa become single states in the dfa.