Please use Determinstic Push Down Automata and ONLY USE EMPTY STACK MODEL

Design a DPDA with proper comments to accept each of the following languages by empty stack model. {1^2m 0^2m | m>0} union {1^n 2^2n| n>0} {a^n ba^m ba^m+n | m, n greaterthanorequalto 0}