The strings X [1 ... n] and Y [1 ... m] are given. Our goal is to convert the string X [1 ... n] to the string Y [1 ... m] with the least cost. The cost of adding a new character is K Dollars, the cost of deleting an existing character is T Dollar, and the cost of converting an x character to a y character is f (x, y) Dollar. Here K and T are given positive integers, and f (x, y) is a positive integer value function. a) Write down the recurrence required to solve the problem with dynamic programming method. b) Write the pseudo code of the algorithm you designed with dynamic programming method. c) Let K = 2, T = 1 and f (x, y) function given by the table below. (In this table, the x variable is given in the column and the y variable is given in the row.)

Calculate the minimum cost of converting the word ARABA to the word BASAR by applying the algorithm you wrote.

Please use keyboard and answer all question don't answer with missing parts

A B $ R 0 1 1 1 1 A 2 0 2 1 4 B$ 22 2 1 04 40 1 4 R 2 4 1 4 0