// Given an input string s and a pattern p, implement regular expression matching with support for '.' and '*' where:

// - . Matches any single character.​​​​
// - * Matches zero or more of the preceding element.

// The matching should cover the entire input string (not partial).

// Example 1:

// Input: s = "aa", p = "a"
// Output: false
// Explanation: "a" does not match the entire string "aa".

// Example 2:

// Input: s = "aa", p = "a*"
// Output: true
// Explanation: '*' means zero or more of the preceding element, 'a'. Therefore, by repeating 'a' once, it becomes "aa".

// Example 3:

// Input: s = "ab", p = ".*"
// Output: true
// Explanation: ".*" means "zero or more (*) of any character (.)".

// Constraints:

// - 1 <= s.length <= 20
// - 1 <= p.length <= 20
// - s contains only lowercase English letters.
// - p contains only lowercase English letters, '.', and '*'.
// - It is guaranteed for each appearance of the character '*', there will be a previous valid character to match.

// Suppose you have a database schema with three tables: Employees, Departments, and Salaries.
//  The Employees table stores information about employees, including their EmployeeID, Name, and DepartmentID.
//   The Departments table contains information about different departments in the company, including their DepartmentID and DepartmentName.
//    The Salaries table contains historical salary information for each employee, including their EmployeeID, Salary, and Date (when the salary was effective).
//     Write an SQL query to find the top 3 departments with the highest average salary of employees hired in the year 2023.