Consider the string editing problem described in the textbook. You are given two strings: X $=$ ababb and Y $=$ aaaab. You are to transform X to Y with a minimum cost. The cost of a deletion is $2,$ the cost of an insertion $3,$ and the cost of a change is $4.$ Show the steps of a dynamic programming algorithm to determine the minimum costs steps that need to be taken. $5.(10$ points$)$ Consider the string editing problem described in the text book. You are given two strings: $\backslash ($ X$=$a b a b b $\backslash )$ and $\backslash ($ Y$=$a a a a b $\backslash ).$ You are to transform $\backslash ($ X $\backslash )$ to $\backslash ($ Y $\backslash )$ with a minimum cost. The cost of a deletion is $2,$ the cost of an insertion $3,$ and the cost of a change is $4.$ Show the steps of a dynamic programming algorithm to determine the minimum costs steps that need to be taken.