3. [10 marks] For the string metamorphosis problem, design an efficient algorithm to actually produce the series of operations that transform a string x[1..m] to a string yl1..n] in the least expensive way. u1..nl in the least expensive wav. 3. [10 marks] For the string metamorphosis problem, design an efficient algorithm to actually produce the series of operations that transform a string x[1..m] to a string yl1..n] in the least expensive way. u1..nl in the least expensive wav