Question

here is an algorithm plz let me know its implemention
PUSH(STACK,TOP,MAXSTK,ITEM)
this procedure pushes an item onto a stack.
1.[stack already filled?]
if TOP=MAXSTK,then:print:OVERFLOW,andReturn.
2.set TOP:=TOP+1.[incrases TOP by 1.]
3.set STACK[TOP]:=ITEM.[Insert ITEM in new TOP position.]
4.Return.

Answer 1

using which language?

Answer 2

in c++.