Added the Aho-Сorasiсk algorithm

[LIFEfreedom]

Description

Added the Aho-Сorasiсk algorithm, which implements an effective search for all occurrences of all sample strings in a given string.
The task. The input receives several lines pattern [i] and line s. Our task is to find all possible occurrences of pattern [i] strings in s.

The essence of the algorithm is to use a data structure - suffix tree and build a finite deterministic automaton on it

Checklist

• An issue (Algorithm request: Aho-Corasick #144) was first created before opening this pull request
• The new code follows the contribution guidelines
• I have performed a self-review of my own code
• I have commented my code, particularly in hard-to-understand areas
• I have made corresponding changes to the documentation
• My changes generate no new warnings
• I have added tests to ensure that prove my fix is effective or that my feature works
• New and existing unit tests pass locally with my changes