Create Regular Expression Matching solution with Recursion

[Bucke200]

The provided Java code solves the Regular Expression Matching Problem by determining if a given input string s matches a specified pattern p. The pattern can include special characters:

1. " . "matches any single character.
2. " * " matches zero or more occurrences of the preceding character. The implementation uses memoization to store results for string and pattern combinations, enhancing performance, while employing recursive logic to efficiently handle character matching and special characters like . and *.

• 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