In this assignment, you will implement a task management system. The goal is to practice basic

data structures and algorithms. Instructions:

$1.$ Problem Statement: Implement a basic system to manage a list of tasks. Each task has a

priority $($a number$)$ and a due date $($in the format YYYY$-$MM$-$DD$).$ For example: $(5,"2024-09-10").2.$ Task Requirements:

$1)$Simple Data Structure:

i$.$ Use a list to store tasks. Each task should be represented as a tuple $($priority$,$ due$\_$date$),$ e$.$g$.,(5,"2024-09-10").$ ii$.$ Write a function to add a new task to the list. iii. Write a function to display all tasks. $(2)$ Sorting Tasks:

i$.$ Implement a simple sorting algorithm to sort tasks by priority $($highest priority first$).$ You may use Bubble Sort for simplicity or select another sorting algorithm of your

choice. Provide a brief explanation of how your sorting algorithm $(3)$ Basic Operations:

i$.$ Write a function to find the task with the highest priority. ii$.$ Write a function to remove a task by its priority. $(4)$ Complexity Analysis:

i$.$ Analyze the time complexity of the sorting algirithm you implement in $2).$ ii$.$ Write a short explanation $(1-2$ sentences$)$ of how the time it takes to add, find, and

remove tasks might change as the number of tasks increases. $(5)$Report and Reflection: Write a brief report $($maximum $1$ page$)$ describing:

i$.$ How you implemented the data structures and algorithms. ii$.$ Any challenges you faced and how you solved them. iii. What you learned from this assignment.