They came down to our campus to hold two rounds of interviews.

Write a function in the language of your choice that takes in two strings and returns true if they match. The constraints are as follows:

• String 1, the text to match to, will consist of alphabets and digits.
• String 2, the pattern, will consist of alphabets, digits, '.' and '*'.

Here's what the special characters mean:

• . means either an alphabet or a digit will be considered a match.
• * means the previous character can be repeated 0 or more times.

For example:

Text: Facebook Pattern: F.cebo*k Returns: true