$(30$ points$)($Dynamic Programming$)$ You are given an array of positive integers. Define the recurrence relation for the problem of partitioning the array into two nonempty subarrays such that the absolute difference between the sums of the subarrays is minimized.