Greed and Chocolate You have a chocolate bar consisting of n chunks. Each chunk $1<=$ i $<=$ n has some positive value vi $($for example, chunks with high nougat content are more valuable!$)$

You must break the bar into exactly k parts to share with your friends, where each part consists of some number of contiguous, unbroken chunks. The value of a part is the sum of the value of all chunks in that part. Your $($greedy$)$ friends chose their parts first, and you get the part remaining, i$.$e the part of smallest value. Thus, your goal is to break in such a way that you maximize the value of the minimum value part.

Give a dynamic program to solve this problem. What is the runtime of your algorithm?