input: Write a python function to implement a stack with methods for pushing, popping, peeking, checking if it's empty, and getting its size.
  assert stack.is_empty() == True
  stack.push(1)
  stack.push(2)
  assert stack.peek() == 2
  assert stack.pop() == 2
  assert stack.get_size() == 1
  assert stack.pop() == 1
  assert stack.is_empty() == True
output: class Stack:
      def __init__(self):
          self.items = []
  
      def push(self, item):
          self.items.append(item)
  
      def pop(self):
          if not self.is_empty():
              return self.items.pop()
          raise IndexError("pop from empty stack")
  
      def peek(self):
          if not self.is_empty():
              return self.items[-1]
          raise IndexError("peek from empty stack")
  
      def is_empty(self):
          return len(self.items) == 0
  
      def get_size(self):
          return len(self.items)
  
  # Example usage:
  stack = Stack()
  assert stack.is_empty() == True
  stack.push(1)
  stack.push(2)
  assert stack.peek() == 2
  assert stack.pop() == 2
  assert stack.get_size() == 1
  assert stack.pop() == 1
  assert stack.is_empty() == True