Draw a pushdown automaton that recognizes the following languages.

(a) L1 = { uw | u and w are strings over {0,1} and have the same length }

(b) L2 = { u0w | u and w are strings over {0,1} and have the same length }