Implement the actual program in C++ Just 1 algorithm with the following specifications:

Write a program that solves Exercise 2.19 in C++. You need to modify the programs for each of the 4 algorithms for the maximum-subsequence-sum problem so that the program not only returns the maximum sums of subsequences of the given integer array but also returns/outputs the actual subsequence where the sum of integers is maximum.

Exercise 2.19: The maximum contiguous subsequence sum algorithms in the text do not give any indication of the actual sequence. Modify them so that they return in a single object the value of the maximum subsequence and the indices of the actual sequence.

2 Cubic maximum contiguous subsequence sum algorithm 4 int maxSubSum1( const vector int> & a ) int maxSum 0; for( int i 0; i maxSum) maxSum thisSum; return maxSum; Figure 2.5 Algorithm 1