You are given a string comprised of symbols
b. You have to perform certain operations on it.
In each operation, you must select an occurrence of the substring
ab in the string and replace it with
bba. You must keep doing such operations until there is no occurrence of the string
The task for this problem is to: Give an algorithm, whose input is such a string, and which computes the minimum number of operations until the string is free of occurrences of
This problem is a part of Tessellate S.T.E.M.S.