Consider the following declarations.
a. Write a funtion Pus h (the declaration is provided) that will push the value of item onto the top of the stack. If the stack is full and the item cannot be added, the function should return a 1. If the item is successfully pushed, the function should return a 0.
b. Write a function Pop that will pop an item from the top of the stack. Like Push, this function will return a 1 if the operation is unsuccessful. That is, a Pop was attempted on an empty stack. It should return a 0 if successful. Consider carefully how the popped value can be returned to the caller.