Non deterministic PDA

Question

Can the NPDA constructed to accept L, such that L = L₁ U L₂ , L1 = {1ⁿ 0ⁿ | n > 0} and L2 = {0ⁿ 1²ⁿ | n > 0} be drawn like this?

This is an informal representation of NPDA. Is this correct?

Or should the NPDA accepting language L should have 2 final states? 

Answer 1

CFL is closed under union and both L1 and L2 are DCFL so L is CFL.

Now second point is ,your rough state transition diagram correct or not. No its NOT correct , in this diagram you considered L1= {0ⁿ 1ⁿ | n>0}