It is in the form anbncn which is CSL.
Let's see why :
On seeing a, you push to stack, on seeing b you pop out from stack essentially comparing number of b’s with a’s. When it sees a c, well, there’s nothing it could do as the one memory it had got used up.
Hence it is not CFL and cannot be accepted by a Push down automata. It needs a Linear Bounded Automata to accept it .