Given a `text` and a wildcard `pattern`, implement wildcard pattern matching algorithm that finds if wildcard pattern is matched with text. The matching should cover the entire text (not partial text).\n\nThe wildcard pattern can include only `?` \u2013 matches 0 or 1 of previous character.\n\n**Example 1:**\n``` \nInput: pattern = "be?t", text = "bet"\nOutput: true\n```\n\n**Example 2:**\n```\nInput: pattern = "ton?e?", text = "\'to"\nOutput: true\n```\n\n**Example 3:**\n```\nInput: pattern = "ton?e?", text = "tonne"\nOutput: false\n```\n\nRelated problems:\n* https://leetcode.com/problems/wildcard-matching/\n

Given a text and a wildcard pattern, implement wildcard pattern matching algorithm that finds if wildcard pattern is matched with text. The matching should cove