Union of two DCFL is ?

Question

Consider two languages LA and LB over Σ={a,b}.
LA= {a^ib^ja^k | i,j,k ≥ 0 and j=i+k}
LB= {b^ia^jb^k | i,j,k ≥ 0 and j=i+k}
Then ( LA ∪ LB ) is :

 A DCFL but not regular
  
 B CFL but not DCFL
  
 C None of the above
  
 D CSL but not CFL

Comments

@Panda

see, the idea given by Anu sir,

this is what i have also told.

---

Anu Sir and Nitish Sir.. thanks a lot..

Anu Sir..is this what I thought initially but couldn't think how to will deal for the union case. Thank you :)

---

for LA union LB,only initial stage will be decisive and it is just DPDA but it still has to make sure j=i+k