INFSCI 2591: Algorithm Design Project 1 Due: February 7, 2017 Write a program with a divide-and-conquer algorithm that finds the two indices (i and...

Write a C /C++ program with a divide-and-conquer algorithm that finds the two indices (i and j, 1 <= i <=

j <= n) in an array of integers with the maximum sum of contiguous elements. For example, if the

array elements are: 2, 18, -22, 20, 8, -6, 10 -24, 13, 3, then the returned indices should be i=4 and

j=7.

for example,

Input: 2, 18, -22, 20, 8, -6, 10 -24, 13, 3, Output: Maximal sub array : I = 4 and j =