Implementing Queue Data Structure in C

# Introduction

In this project, you will learn how to implement a queue data structure in C. Queues are widely used in computer science, for example, in message queues that are used to transmit data in a computer.

## 👀 Preview

$ gcc queue.c -o queue
$ ./queue
11250

## 🎯 Tasks

In this project, you will learn:

- How to implement the `front()` method to return the value of the front element in the queue
- How to implement the `pop()` method to remove and return the front element from the queue
- How to implement the `count()` method to return the number of elements currently in the queue
- How to implement the `is_empty()` method to check if the queue is empty

## 🏆 Achievements

After completing this project, you will be able to:

- Understand the basic operations of a queue data structure
- Implement the core methods of a queue in C
- Apply your knowledge of queues to solve real-world problems