Problem Description: Nathan wants to implement wildcard pattern matching supporting only the wildcard '?'. The wildcard character '?' can be substituted by any single lower case English letter for matching. He has two strings X and Y of equal length, made up of lower case letters and the character '?'. He wants to know whether the strings X and Y can be matched or not. Constraints: 1 ≤ I ≤ 50 Both X and Y have equal length and the length is between 1 and 10. Both X and Y consist of lower case letters and the character '?'. Input Format: The first line of input contain an integer 'T' denoting the number of test cases. Each test case consists of two lines, the first line contains the string 'X' and the second contains the string 'Y'. Output Format: Print the output a single line with the word 'Yes' if the strings can be matched, otherwise output 'No'.

Problem StatementBob loves playing a string-matching game where he tries to match two strings based on a specific pattern. In this game, players input two strings, and the game determines whether they match according to a set of rules. Here are the rules of the game:A '*' in the first string represents zero or more characters.A '?' in the first string represents exactly one character.Any other character in the first string must match the corresponding character in the second string.Bob has requested your assistance in completing the game mentioned above.Input format :The first line of input consists of a string str1 containing the characters along with the symbols - ? and *.The second line consists of the string str2, without any symbols.Output format :The first line displays the "Second string: " followed by str2 as string, representing the second input string.The second line displays the following format:"The strings match" if the first string matches the second according to the pattern rules."The strings do not match" if the first string does not match the second according to the pattern rules.Refer to the sample output for the formatting specifications.Code constraints :In the given scenario, the test cases fall under the following constraints:2 ≤ length of the string (str1, str2) ≤ 15Sample test cases :Input 1 :i?mneoiamneoOutput 1 :Second string: iamneoThe strings matchInput 2 :i?miaamOutput 2 :Second string: iaamThe strings do not matchInput 3 :i*mn?oiaamneoOutput 3 :Second string: iaamneoThe strings matchInput 4 :a?b?c?d?e?f?ghaxbxcydzefffghOutput 4 :Second string: axbxcydzefffghThe strings matchInput 5 :a*cacOutput 5 :Second string: acThe strings matchNote :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.

1.Question 1In Search Processing Language (SPL), which special character is a wildcard that can be used to substitute with any other character?1 point*| = !=

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: falseExplanation: "a" does not match the entire string "aa".Example 2:Input: s = "aa", p = "a*"Output: trueExplanation: '*' means zero or more of the preceding element, 'a'. Therefore, by repeating 'a' once, it becomes "aa".Example 3:Input: s = "ab", p = ".*"Output: trueExplanation: ".*" means "zero or more (*) of any character (.)". Constraints:1 <= s.length <= 201 <= p.length <= 20s 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.

In Search Processing Language (SPL), which special character is a wildcard that can be used to substitute with any other character?1 分*!=| =

Write a program that asks the user to input two strings: an input string and a"pattern" string. Both strings contain only lowercase alphabet, and the"pattern" string is shorter than the input string. The program finds and countsnumber of occurrences of the "pattern" string in the input string, assuming thatthe number of occurrences is less than 10. The program replaces the firstcharacter of the first appearance of the "pattern" string in the input string by '1'and the first character of the second appearance of the "pattern" string in theinput string by '2' and so on so forth. Finally, the program outputs two strings:the original input string and the modified string, a string in a line, ended withnewline.