Convert the given NFA to DFA
See this page.
Essentially, create a new DFA $D$ in which the set of states $Q$ is the powerset of the set of states of your NFA $N$.
For $q \in Q$ and $a \in \Sigma$, add transition $\delta(q,a) = q'$ to $D$, if and only if, the set of states of $N$ that are reachable (in $N$) from at least one state in $q$ by reading character $a$ is exactly $q'$.
Mark a state of $q \in Q$ as a final state in $D$ if and only if $q$ contains a final state of $N$.
If $q_0$ is the initial state of $N$, then the initial state of $D$ is the set of states if $N$ that are reachable by $q_0$ using only $\varepsilon$-transitions.