<prompt> Kutoa mfano wa code kwa ajili ya muundo wa data ifuatayo: stack.  <response>: Here is an example implementation of a stack data structure in Python:pythonclass Stackobject: def __init__self: self.items check if stack is empty def is_emptyself: return lenself.items 0 add an element to the stack def pushself, item: self.items.appenditem remove the top-most element from the stack and return it def popself: if not self.is_empty: return self.items.pop else: return Stack is empty check the top-most element of the stack without removing it def peekself: if not self.is_empty: return self.items-1 else: return Stack is empty return the size of the stack def sizeself: return lenself.itemsdefine a stackmy_stack Stackadding elements to the stackmy_stack.push1my_stack.push2my_stack.push3my_stack.push4popping an element from the stackprintmy_stack.poppeeking top element of the stackprintmy_stack.peeksize of the stackprintmy_stack.sizeThis Stack class is using a Python list to store the elements of the stack. Elements are removed and added to the end of the list, following a Last In, First Out LIFO order. The class provides several methods for stack operations, such as push to add an element to the top of the stack, pop to remove the top-most element, peek to view the top-most element without removing it, and size to check the number of elements in the stack. 