Acertain string-processing language offers a primitive operation which splits a string into two pieces. since this operationinvolves copying the original string. it takes 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 in which the breaks are made can affect thetotal running time. for example, if you want to cut a zo-character string at positions 3 and 10, then making the first cut atposition 3 incurs a total cost of 20 + 17 = 37, while doing position 10 first has a better cost of 20 + 10 = 30.give a dynamic programming algorithm that. given the locations of m cuts in a string of length n, finds the minimum costof breaking the string into m + 1 pieces.