Q$1-$ Given an $n-$character input text $T,$ suppose that all characters in the pattern $P$ are different. Show how to accelerate the Na$$ve String Matcher algorithm to run faster in $O(n).$ Assume that variable $j$ indicates the index of the last checked character in $T,$ before mismatch. Also consider two main scenarios where there is no match between the substrings of $T$ and $P,$ and when there are multiple matches between the substrings of $T$ and pattern P$.$ Provide your algorithm's pseudocode. $T$ is $1-$index.

$s=5,$ last checked character at location $j$ before mismatch $j=6,$ if $j$ next $s,$ take next $s$

$T$:$A$ B C O A $|$ A A B C D

$P$:ABCD