class Stack:

def $\_\_$init$\_\_($self$,$ max$\_$size$=5)$:

self.top $=-1$ # Represents the index of the top element in the stack.

self.max$\_$size $=$ max$\_$size # Maximum size of the stack.

self.items $=[""$ for x in range$($max$\_$size$)]$ # The array to store stack items.

def is$\_$empty$($self$)$:

# Check if the stack is empty.

return self.top $==-1$

def is$\_$full$($self$)$:

# Check if the stack is full $($reached its maximum size$).$

return self.top $==$ self.max$\_$size $-1$

def push$($self$,$ item$)$:

if not self.is$\_$full$()$:

# Add an item to the top of the stack.

self.top $+=1$

self.items$[$self$.$top$]=$ item

else:

raise StackFullException$("$Stack is full!"$)$

def pop$($self$)$:

if not self.is$\_$empty$()$:

# Remove and return the top item from the stack.

item$\_$str $=$ self.items$[$self$.$top$]$

self.top $-=1$

return item$\_$str

else:

raise StackEmptyException$("$Stack is empty!"$)$

def peek$($self$)$:

if not self.is$\_$empty$()$:

# Return the top item without removing it$.$

return self.items$[$self$.$top$]$

else:

raise StackEmptyException$("$Stack is empty!"$)$

def size$($self$)$:

# Return the current size of the stack.

return self.top $+1$

def print$\_$stack$\_$up$($self$)$:

# Return a string representation of the stack, with each item on a new line.

stack$\_$str $=""$

for i in range$($self$.$top, $-1,-1)$:

stack$\_$str $+=$ self.items$[$i$]+"$

$"$

return stack$\_$str