Acertain string-processing language offers a primitive operation which splits astring into two pieces. since this operation involves copying the original string, ittakes n units of time for a string of length n, regardless of the location of the cut. suppose, now, that you want to break a string into many pieces. the order inwhich the breaks are made can affect the total running time. for example, if youwant to cut a 20-character string at positions 3 and 10, then making the first cutat position 3 incurs a total cost of 20 + 17 = 37, while doing position 10 first hasa better cost of 20 + 10 = 30.give a dynamic programming algorithm that, given the locations of m cuts in astring of length n, finds the minimum cost of breaking the string into m+ 1pieces.