Need help with algorithms(in detail) on JavaScript please

1 Divide and Conquer Sum In the lectures, we've covered merge sort, which uses a divide-and-conquer ap- proach to sort an array of values. There are many more algorithms that take such an approach. Implement 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 To make it a bit more interesting, instead of splitting into two sub-arrays Submit your complete code, including a function that demonstrates that Hint: Like in the implementation of merge sort, you may need a helper case, and "merge" the sums of the recursive calls otherwise. For example, the return value for the array a [1,5,-1,4] is 9. like in merge sort, I want you to split into three sub-arrays at each divide step. your implementation works with a few test inputs. function that does the actual recursion. Total 5 points