feat: add burst balloons problem

[codec404]

Description of Change

This PR implements the Burst Balloons problem using dynamic programming and memoization, encapsulated within the dynamic_programming::burst_balloons namespace. The algorithm maximizes coins obtained by strategically bursting balloons. Test cases based on the problem statement have been added to ensure correctness.

Checklist

• [x] Added description of change
• [x] Added file name matches File name guidelines
• [x] Added tests and example, test must pass
• [x] Added documentation so that the program is self-explanatory and educational - Doxygen guidelines
• [x] Relevant documentation/comments is changed or added
• [x] PR title follows semantic commit guidelines
• [x] Search previous suggestions before making a new one, as yours may be a duplicate.
• [x] I acknowledge that all my contributions will be made under the project's license.

Notes: This implementation addresses an optimal solution for the Burst Balloons problem (example inputs provided in test cases). It uses memoization to avoid recalculating overlapping subproblems and follows proper documentation practices using Doxygen-style comments.

This submission is intended to enhance the library’s dynamic programming section.