Kata

Your task is to determine, whether a string contains a given pattern or not.
The pattern's letters in a string can be alternated by any number of other letters and/or duplicated any number
of times. The string is valid if all letters from the pattern are present, and their sequence is preserved.
Examples:

Pattern: codewars
String: cccxxfoovbfffooddwqerdddeeuwrwrreqwwbnmjwwayaqrrarrs

cccxxfoovbfffooddwqerdddeeuwrwrreqwwbnmjwwayaqrrarrs
VALID

String: cccxxfeevbfffooddwqordddoouwrwrroqwwbnmjwwayaqrrarrs

cccxxfeevbfffooddwqordddoouwrwrroqwwbnmjwwayaqrrarrs
INVALID, wrong sequence

String: cooddwwwwwwaaaaarrrrsss
INVALID, 'e' is missing.

Write a function pattern_in_string, which takes pattern and string as arguments and returns 'FOUND'
if the patern was found, or 'NOT FOUND' otherwise. Apart from the sample test cases, you will not know
neither pattern nor string, so you need to come up with some general algorithm. Strings in performance tests
are 60k - 240k letters long, so it must be quite efficient, too.
Length of a pattern can be 3 - 10, and letters may repeat.
Both strings and patterns will contain only lower case English letters.
HAVE FUN!