The language accepted by PDA is
L = { $a^{m} b^{n} c^{m + n} $ | m, n >= 0 }
ex: $aaabbccccc$ is accepted by PDA. Whenever $a$ and $b$ comes it pushes into the stack and whenever $c$ comes it pops until the stack is empty.
$\epsilon$ is also accepted.