For this Question: N numbers are arranged in Circle. Find the Sum of all K contiguous Sub-arrays.The first line of the input contains an integer N, the length of the array, and K. The next line contains N integers which are elements of the array. 

<b>User task:</b> Since this is a functional problem you don't have to worry about the input. You just have to complete the function kCircleSum(arr, N, K) which contains arr(array) and N(size of the array), and K as a parameter

<b>Constraints</b> 
1 <= N <= 100000
1 <= arr[I] <= 100000
1 <= K <= NYou need to print N space-separated integers ith integer denoting Sum of sub-array of length K starting at index i.Sample Input
3 1
1 2 3

Sample Output
1 2 3

Explanation : k=1 so ans is 1, 2, and 3.

Sample Input
5 2
6 4 3 4 1 

Sample Output
10 7 7 5 7, I have written this Solution Code: function kCircleSum(arr, arrSize, k)
{
    var list = new Array(2*arrSize + 5)
    
    for(var i = 0; i < arrSize; i++)
    {
      list[i+1] = arr[i]
      list[i+arrSize+1] = list[i+1]
    }
    
     for(var i = 0; i < 2*arrSize; i++)
       dp[i] = 0
    for(var i=1;i<=2*arrSize;i++)
		{
			dp[i] = dp[i-1]+list[i]
		}    
    
      
    var ans = ""
    for(var i = 1; i <= arrSize; i++)
      {
         ans += (dp[i+k-1]-dp[i-1]) + " "
      }
      console.log(ans)
}, In this Programming Language: JavaScript, Now tell me if this Code is compilable or not?