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 TL, the cost of deleting an existing character is TL, and the cost of converting an x character to a y character is f(x, y) dollars. Where k and t are given positive integers, f(x, y) is a positive integer value function. Let k=2, t= 1 and f(x, y) function given by the table below. In this table, variable x is given in the column and variable y is given in the row. Calculate the minimum cost of converting the word ARABA to the word BAAR by applying the algorithm you wrote. A AB 0 2 2 2 A 1 02 2 1 B 1 2 0 04 1 1 40 R 1 4 1 4 R 2 4 1 4 0 1