Question 1
Two strings each consist of 100 letters, all $A$ or $B$. In one step one may insert any number of identical letters at a chosen position, or delete any number of consecutive identical letters. Prove that either string can be transformed into the other in at most100 steps.
