Question 4. X(1.....n) And Y(1...n) strings are being issued. Our goal is at the least cost X(1....n) string Y(1....n) is to turn it into a string. The price of adding a new character is k lira, deleting an existing character the price is t lira and the price of converting an x character to a y character is f(x,y) lira. Here k and t positive inns given and f(x,y) is a positive inn number valued function. a) (15 points) Write the color required to solve the question with dynamic programming method b) (20 points) The so-called code of the algorithm you designed with dynamic programming method (pseudo code) c) (15 points) k=2, t=1, and f(x,y) with the following table. (X variable in this table in column and y variable in row.)

0 A 1 B 1 1 R 1 A B R R 2 2 2 2 0 2 1 4 2 0 4. 1 1 4 0 4 4 1 4 0 1