Just to add to @Joyoshish Saha’s answer.
The union of a regular language and a DCFL is a DCFL. Let the states of the regular language be R and the states of the DPDA be D. Take the product automaton R $\times$ D and add the transitions of the NFA to the product automaton. The result would be another DPDA.