Deterministic PDA for a particular CFL

[gerel]

Hi all,

I was wondering If a determinstic PDA can be constructed for this particular language:

L = {a^n b^(2n) c^k | n>=0, k>=1} U {a^n b^n c^k | n>0, k>=0}
Terminals = {a,b,c}

I managed to get a DPDA for each one separately but I couldn't get the DPDA for the union.

thanks in advance.
cheers