Thread: How find the most frequent symbol with markow algorithm

Code:

Code:

I have such task. There is such alpahbeth as {a, b} in markow algorithm concept. So I need to find out which letters (a or b) are more in word "p". If a then to retrieve the word with letter a, if-b-then word with letter "b", if there is equal quantity then 0. How to do it. Where to find such example, at least some clues how to begin.