Given two strings X[1, . . . , n] and Y [1, . . . , m], find the minimum number of steps required to make X[1, . . . , n] and Y [1, . . . , m] the same. In one step, you can delete exactly...

Given two strings X[1, . . . , n] and Y [1, . . . , m], find the minimum number of steps required to make X[1, . . . , n] and Y [1, . . . , m] the same. In one step, you can delete exactly one character in either string.

Precisely define the subproblem.
Provide the recurrence equation.
Describe the algorithm in pseudocode to compute the optimal value.
Describe the algorithm in pseudocode to print out an optimal solution.