This is an Individual Project on Data Structures and Algorithms, see attached fo

This is an Individual Project on Data Structures and Algorithms, see attached for more information.
Requirements
Data Structures and Algorithms
Your project should incorporate one or more of the following data structures or algorithms in a novel or innovative manner:
Graph Algorithms (e.g., Dijkstra’s, A*, Floyd-Warshall)
Sorting Algorithms (e.g., Heap Sort, Radix Sort)
Advanced Tree Structures (e.g., AVL Trees, Splay Trees)
Hashing Techniques (e.g., Cuckoo Hashing, Dynamic Perfect Hashing)
Dynamic Programming, Greedy Algorithms, and Divide and Conquer Strategies Code Repository
Your project must be hosted in a public Git repository on GitHub, GitLab, or Bitbucket and should adhere to the following criteria:
Include a comprehensive test suite.
Contain a README.md file with setup, installation, and execution instructions.
Have a CONTRIBUTORS.md file listing each group member’s contributions.
Follow best coding practices relevant to your chosen programming language.
Benchmarks
You are required to benchmark the performance of your project focusing on metrics such as execution time and memory usage. The benchmarking code and a summary of the results must be included in your repository.
Presentation
Each Person will deliver a 5-minute presentation, covering the introduction, background, methodology, results, and conclusions of your project.
Rubric
see attached
Submission
Submit your project via the provided Final Project Form, including the project name, project description, utilized data structures/algorithms, repository URL, and presentation URL.