Give a greedy algorithm that receives a person$$s string $($of n characters$)$ and a

pattern string $($of m characters$),$ and decide in time O$($m$+$n$)$ whether the person$$s string contains that pattern. Formal proof that the algorithm always returns a correct answer, using a $$stay ahead$$ argument