Problem
Write code for the following functions. [Your code must use Stack methods, but you should not make any assumptions about how stacks or their methods are actually implemented. For some functions, you may wish to declare and use a second, temporary Stack object.]
(a) Function bool full(Stack &s) leaves the Stack s unchanged and returns a value of true or false according to whether the Stack s is or is not full.
(b) FunctionError_code pop_top(Stack &s, Stack_entry &t)removes the top entry from the Stack s and returns its value as the output parameter t.
(c) Function void clear(Stack &s) deletes all entries and returns s as an empty Stack.
(d) Function int size(Stack &s) leaves the Stack s unchanged and returns a count of the number of entries in the Stack.
(e) Function void delete_all(Stack &s, Stack_entry x) deletes all occurrences (if any) of x from s and leaves the remaining entries in s in the same relative order.