<SYSTEM_TASK:>
Given the following text description, write Python code to implement the functionality described.
<END_TASK>
<USER_TASK:>
Description:
Divide a sorted array in K parts with sum of difference of max and min minimized in each part
Function to find the minimum sum of differences possible for the given array when the array is divided into K subarrays ; Array to store the differences between two adjacent elements ; Iterating through the array ; Appending differences to p ; Sorting p in descending order ; Sum of the first k - 1 values of p ; Computing the result ;

<ASSISTANT_TASK:>
Python Code:
def calculate_minimum_split(a , k ) : 
	 p =[] 
 n = len(a ) 
 for i in range(1 , n ) : 
	 p . append(a[i ] - a[i - 1 ] ) 
  p . sort(reverse = True ) 
 min_sum = sum(p[: k - 1 ] ) 
 res = a[n - 1 ] - a[0 ] - min_sum 
 return res 
  / * Driver code * / 
 if __name__== "__main __": 
	 arr =[4 , 8 , 15 , 16 , 23 , 42 ] 
 K = 3 
 print(calculate_minimum_split(arr , K ) ) 
 
<END_TASK>
