What are Lists?
Lists are a fundamental data structure in programming and mathematics, used to store multiple items in a single variable. They can hold a variety of data types and are versatile for both simple and complex applications.

Types of Lists

1. Ordered List
- Items are arranged in a specific sequence.
- Example: A shopping list: ["Milk", "Eggs", "Bread"].
- The order matters; the first item is "Milk", followed by "Eggs", and so on.

2. Unordered List
- Items are not arranged in any particular order.
- Example: A list of fruits: ["Apple", "Banana", "Cherry"].
- Here, the sequence of items does not affect their identity; any fruit can be picked without regard to order.

3. Nested List
- Lists that contain other lists as their elements.
- Example: A list of students with their grades: [["Alice", 85], ["Bob", 90], ["Charlie", 78]].
- Each sub-list holds a student's name and their grade.

4. Multi-Dimensional List
- A list consisting of multiple lists of equal length, often used in matrix representation.
- Example: A 2D grid: [[1, 2, 3], [4, 5, 6], [7, 8, 9]].
- This can represent a table or board layout.

5. Dynamic List
- Lists that can grow or shrink in size during program execution.
- Example: A list of user inputs that can change as users add or remove items.
- They provide flexibility to handle varying amounts of data.
Lists are essential for data organization and manipulation in various programming tasks, making them a key concept in computer science.