Dynamic Programming·DP on Intervals·FoundationThe innermost loopAn interval DP has three nested loops. The innermost runs over a variable usually called k.What is it doing?ATrying every place the range could be cut in two, keeping the bestBTrying each element in turn that could be removed from the rangeCCounting how many elements the range containsDChecking whether the range is a valid subproblemCheck answer