PLEASE ONLY USE EMPTY STACK PUSH DOWN AUTOMATA

Design a PDA with proper comments to accept each of the following languages by empty stack model. NO credit will be given if you design a CFG and then convert it to the equivalent PDA. {a^nb^mc^k| m + k = n, where n, m, k greaterthanorequalto 0} {a^nb^mc^k | n + k = m, where n, m, k > 0}