In the Na$$ve String Matching Algorithm, suppose that all the characters in the pattern P are different. Make changes to the original algorithm pseudocode to make improvements to the algorithm$$s time complexity when the algorithm is running on an n$-$character input text T and

re$-$write the pseudocode. Then, explain your strategy. What is the Big$-$O complexity of your proposed algorithm? Provide a detailed explanation to support your computation.