Scenario: You are working on a project management tool in Python. One of the features

of the tool is to maintain a list of project tasks, where users can add new tasks, remove

completed tasks, and view the current tasks in the order they were added. To implement

this functionality, you decide to use a queue data structure.

Task: Implement a queue data structure in Python to manage the list of project tasks in

the project management tool. Your implementation should include the following

functionalities:

$1.$ Implement a queue to store project tasks.

$2.$ Implement functions to add new tasks to the queue, remove completed tasks from

the queue, and view the current tasks in the queue.

$3.$ Ensure that the tasks are maintained in the order they were added $($FIFO $-$ First In$,$

First Out$).$

Guidelines:

$1.$ Design your queue data structure to efficiently manage project tasks, considering

the requirements of the project management tool.

$2.$ Implement functions to add new tasks, remove completed tasks, and view current

tasks while maintaining the FIFO order.

$3.$ Provide a test scenario where multiple tasks are added, some tasks are completed

and removed, and then the current list of tasks is viewed.

$4.$ Demonstrate the functionality of your queue implementation by printing the list of

tasks at different stages of the test scenario.

$5.$ Write clean and well$-$commented code following Python best practices.

Submission: Submit your implementation code along with a brief explanation of your

design choices and the rationale behind them. Additionally, provide a test scenario

demonstrating the functionality of your queue implementation in managing project tasks

effectively within the project management tool