Pushdown Automaton

1. Provide a pushdown automaton for the language: {0^(n)1^(2n), n>0}, where '^' denotes the power operator. Example of strings in the language {011, 001111, ...}

2. Provide a deterministic pushdown automaton for the language of all binary strings that contain an equal number of 1s and 0s. Example of strings in the language {e, 10, 01, 0101, 0011, 011100, ...}

Could you also please include the images produced by JFLAP for each of the above PDAs!

Thank you!