In computer applications, pattern matching is used to find a given pattern within a piece of text. Different systerns may have different rules or types pattern matching.

One particular system employs the following rules for pattern matching:

The system counts the locations starting from $0.$ That is$,$ the first character location is $0,$ the second character location is $1,$ etc.

The system allows two types of matching: an exact match and a closest match

Exact match is when all the characters in the pattern are found exactly within the text. For example, if the text is "three big