JavaScript pattern matching

Given a string text and a pattern, evaluate if a given text string matches a specified pattern utilizing special characters for pattern matching. The pattern matching should adhere to the following rules. The symbol, full stop, represents any individual character. The symbol, asterisk, indicates zero or more occurrences of a character that appears just before it. Return true if the pattern corresponds exactly to the entire text string. If not, return false. Note, your implementation should be dependent on regular expression or similar convenience libraries. Your implementation should be able to handle all hidden test cases correctly. Example 1, the input text is aa. Pattern is a. Output is false. Explanation, the symbol a does not match the full text aa. Example 2, text is aa, pattern is a. Output, okay, pattern is a asterisk. Output is true. Explanation, the pattern a asterisk can represent aa as asterisk allows for repeating a. Example 3, input ab asterisk dot asterisk. Output is true. Explanation, the pattern dot asterisk can match any sequence of characters. Okay, constraints, one is less than equals text dot length less than equals 20. One is less than equals pattern dot length less than equals 20. Text contains only lowercase English letters. Pattern contains only lowercase English letters, dots and asterisks. It is guaranteed for each appearance of the character asterisk. There will be a previous valid character to match. Okay, and I'll be solving this using JavaScript. Alright.