Divide a circular array into K groups of contiguous elements such that difference between max & min sum is minimized

I was going through below question found on codeproject[Link mentioned below]. Can anyone please help me to solve this problem ? What approach I can use here.

How can I divide a circular array into k group of contiguous element such that difference between maximum sum and minimum sum is minimum. Each group have contiguous element of array.
For e.g If the array is as follow.
[6 13 10 2] and k=2 then o/p should be 18(6+10+2)-13=5. As array is circular 6,10,2 are contiguous element of array.

For e.g If the array is as follow.
[6 13 2 10] and k=2 then o/p should be 16(6+10)-15(13+2)=1. As array is circular 6,10 are contiguous element of array.

For e.g If the array is as follow.
[100 92 133 201 34 34 34 94 108] and k=4 then group as follow 208(108,100), 225(92,133), (201), 196(34,34,34,94) so 225-196=29

Reference : https://www.codeproject.com/Questions/1189428/How-can-I-divide-an-circular-array-into-k-group-of

//