implemented chinese remainder theorem with tests

[SuprHUlk]

Description of Change

This pull request implements the Chinese Remainder Theorem (CRT) algorithm to solve issue #5772.

The implementation includes:

• A function (solveCRT) that calculates the solution using the product of moduli and their modular inverses.
• A helper method (modInverse) that computes the modular inverse using the Extended Euclidean Algorithm.
• Detailed documentation adhering to Doxygen standards, with a reference to Wikipedia for further details.
• Comprehensive unit tests that verify the implementation across different scenarios, including simple cases, larger numbers, and edge cases to ensure accuracy and reliability.

Checklist

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized it.
• All filenames are in PascalCase.
• All functions and variable names follow Java naming conventions.
• All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
• All new code is formatted with clang-format -i --style=file path/to/your/file.java.