Edit Distance variation
===

Going through "Introduction to algorithms" by "Cormen et al ", I came across a very popular question of dynamic programming named as "Edit Distance". While reading it and devising its solution I got troubled with a possible variation of the same. <br> <br>
Suppose the question is as:<br/>
We are given two strings and operations: copy, insert, delete, match, twiddle, kill.<br>
Also as input we are given the number of transformations (say: **n**).<br>
Find if it is possible to transform first string to second in exactly "n" transformations .<br><br>
**Note:** The number of transformations given may be greater than the minimum number of transformations.

Thanks in advance.