Question 1 A stack is LIFO linear data structure with the following operations: 1. Push : adds key to the top of the stack int push(int value) if (Ifull)) top-top1 tack[top]-value 2. Top 0:returns the key at the top of the stack but does not remove key from the stack int Top) return stack[top]: 3. Pop () : removes and returns the key at the top of the stack int pop)( int value; f (lemptyO) value stack[top] top-top-1 return value 4. Empty : Determines whether the stack is empty int enptyO f (top-1) return 1 else return 8; 5. Full : Determines whether the stack is already full