I'm needing help with this algorithm. It is written in JavaScript.

There are many more algorithms that take such an approach. Implernent a function that computes the sum of an array of integers using divide and conquer. The function should have the following signature: function divideAndConquerSum(a); where a is the array. The recursive calls sum up the numbers in the base case, and merges the sums of the recursive calls otherwise. For example, the return value for the array a = [1,5,-1,4] is 9. To make it a bit more interesting, instead of splitting into two sub-arrays like in merge sort, I want you to split into three sub-arrays at each divide step. Submit your complete code, including a function that demonstrates that your implementation works with a few test inputs. Hint: Like in the implementation of merge sort, you may need a helper function that does the actual recursion. Total 5 points