You are learning a weird new programming language for string processing. The

language has a primitive operation which splits a string into two pieces. In a string of length

$n,$ the computational cost of splitting between index i and $i+1($indexed from $1)$ is $n$ for

any index $i.$ Call such an operation a split at $i.$ If you want to split your string into multiple

pieces, this means it matters what order you perform the splits in$.$ Formally:

Input: A string $s=s_{1}dots{s}_n$ and split locations $l(0)l(k+1)l(1),$dots,$l(k)s=jkl.l(1)=1,l(2)=4sa,xdfjkl7+4=11(i,j)s_{l(i)+1}dots{s}_{l(j)}l(i+1),$dots,$l(j-1)OPT(i,j)OPT(i,i)ii$