Project Tasks:$1.$ Problem Identification: Select a problem suitable for algorithmic solutions$\mathrm{.}2.$ Algorithm Development: Propose a naive and an optimized algorithm to solve theproblem$\mathrm{.}3.$ Implementation: Code both algorithms in a chosen programming language, prefereblyPython or C$++\mathrm{.}4.$ Theoretical Analysis: Determine the asymptotic time and space complexities of bothalgorithms$\mathrm{.}5.$ Empirical Analysis: Test both algorithms with various input sizes and documentperformance$\mathrm{.}6.$ Results Comparison: Compare theoretical and empirical results, and explain anydiscrepancies$\mathrm{.}7.$ Final Report: Document the project findings in a thorough report$\mathrm{.}8.$ Presentation: