Implemented the Matrix Chain Multiplication algorithm in R.

[Sachinn-64]

• Finds the most efficient way to multiply a sequence of matrices using dynamic programming.
• Efficient O(n³) DP implementation with optimal parenthesization generation.
• Handles edge cases including single matrices and finds all optimal solutions.
• Prints DP table, split table, and cost analysis with real-world examples.
• Time Complexity: O(n³) where n = number of matrices.
• Space Complexity: O(n²) for DP table.

[Copilot]

Pull Request Overview

This PR implements the Matrix Chain Multiplication algorithm in R using dynamic programming to find the optimal parenthesization that minimizes scalar multiplications when multiplying a sequence of matrices.

• Complete DP implementation with O(n³) time complexity and O(n²) space complexity
• Includes space-optimized version, edge case handling, and comprehensive testing
• Provides utilities for visualizing DP tables, analyzing costs, and finding multiple optimal solutions

---

_{Tip: Customize your code reviews with copilot-instructions.md. Create the file or learn how to get started.}

[Copilot]

Pull Request Overview

Copilot reviewed 1 out of 1 changed files in this pull request and generated 4 comments.

---

_{Tip: Customize your code reviews with copilot-instructions.md. Create the file or learn how to get started.}

[Sachinn-64]

@siriak

[siriak]

Please check comments

[Copilot]

Pull Request Overview

Copilot reviewed 1 out of 1 changed files in this pull request and generated 3 comments.

---

_{Tip: Customize your code reviews with copilot-instructions.md. Create the file or learn how to get started.}

[Sachinn-64]

@siriak pls check now

[Copilot]

Pull Request Overview

Copilot reviewed 1 out of 1 changed files in this pull request and generated 4 comments.

[siriak]

Looks good, thanks!