Q$2.$ You are given two strings $S$ and $T$ with $n$ characters each. Your goal is to design an algorithm to show whether $T$ is a right cyclic shift of $S.$

Example:

$S=$ "LEAP", $T=$ "PLEA"

T is a right cyclic shift of S $.$

$($a$)$ Design a time$-$efficient algorithm for the task by modifying Horspool's algorithm. Explain how you modify the algorithm.

$($b$)$ Apply the algorithm to the example above showing the table $($assuming your alphabet are only the characters in T$,$ add one entry for all other characters$)$ and the shift value in every step.

$($c$)$ Indicate the time and space efficiencies of your algorithm.