X [1 ... n] and Y [1 ... m] Strings (strings) are given. Our goal is with the least cost X [1 ... n] string Y [1 ... m] converting to string. Adding a new character costs k dollars, deleting an existing character It costs t dollars and the cost of converting an x character to a y character is f (x, y) dollars. Where k and t given positive integers, f (x, y) is a function with positive integers. a) Write down the recurrence required to solve the problem with dynamic programming method. b) The pseudo code of the algorithm you designed with dynamic programming method (pseudo code) c) Let k = 2, t = 1 and f (x, y) function given by the table below. (In this table the x variable column and y variable is given in the row.)