Problem Statement  
You are given two Strings: A and B. You would like to align these two strings by inserting '' characters in them so that every character in A lines up with the same character in B or with a '' in B, and vice versa. Each maximal sequence of consecutive '' characters costs x, plus an additional 1 per each '' character. For example, changing "ABC" to "ABC" costs x+1+x+1, while changing it to "ABC" costs x+2. Given, A, B, and x return the minimum cost to align the two strings.  
Definition  
 
Constraints  
  A and B each contain between 1 and 50 uppercase letters ('A''Z'), inclusive.  
  x will be between 0 and 100, inclusive.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
