Design PDAs for the following languages. For each language, give an informal description of your PDA and the state diagram.

(a) {0^i 1^j 0^i | i, j1} (b) {a^i b^j c^k | i = j or j = k, where i ,j ,k 0}.

Please provide the informal descriptions like

"if the top of the stack is a variable / terminal / $, (select one rule and substitute) / (read next symbol and compare)/(enter accept state ..."