Problem: Implement a Stack using Python

 Implement a stack data structure in Python. A stack is a linear data structure that follows the Last-In, First-Out (LIFO) principle, where the last element added to the stack is the first one to be removed.

Your task is to create a Python class called Stack that has the following methods:

push(item): Adds an item to the top of the stack.

pop(): Removes and returns the item from the top of the stack.

peek(): Returns the item currently at the top of the stack without removing it.

is_empty(): Returns True if the stack is empty, and False otherwise.

size(): Returns the number of items in the stack.

You can implement the stack using a list as the underlying data structure.

Here's a basic structure for the Stack class:

class Stack:

    def __init__(self):

        # Initialize an empty stack

        pass

    def push(self, item):

        # Add item to the top of the stack

        pass

    def pop(self):

        # Remove and return the item from the top of the stack

        pass

    def peek(self):

        # Return the item at the top of the stack without removing it

        pass

    def is_empty(self):

        # Return True if the stack is empty, False otherwise

        pass

    def size(self):

        # Return the number of items in the stack

        pass