You're given a Eventually Periodic representation of some Boolean strings bob1....b,= B(P) lets say, B(P)=001(01) Write an algorithm to find out the Minimal eventually periodic representation of a Boolean string. Hint: Do a long division for n/m, what are those n,m? What is the overall complexity in terms of |B|+|P|? You're given a Eventually Periodic representation of some Boolean strings bob1....b,= B(P) lets say, B(P)=001(01) Write an algorithm to find out the Minimal eventually periodic representation of a Boolean string. Hint: Do a long division for n/m, what are those n,m? What is the overall complexity in terms of |B|+|P|