Array$-$nageddon: The Ultimate Backtracking Hellscape Let $T[1..n](n1)$ be an

array of real non$-$negative values $($ Tin$1..n{R}^{+}).$ There are at least two indices, i and

$j,$ defining the interval $i..j,$ with $1ijn,$ such that the value of the expression

$T[j]-T[i]$ is maximum. We are looking for this maximum value $($the value of the best

interval$).$ The special case where $i=j$ characterizes a monotonic array strictly decreasing:

the value searched for is then zero. Give a recurrence to solve this problem! Make sure to

give an English description.