1. Rewrite the four algorithms to find the two indices (the boundary indices) of a maximum subsequence in addition to the value of maximum subsequence sum. Each algorithm should returns or computes (not print) the three values. The three values are printed in the main program which reads the input data. 2 Submit the source code of your programs and CPU times of the four algorithms. To compute the CPU time in Java use the following long. Start= System. nanoTime(); Your code or function call.do not include the code for generating the data. long End= System.nano Time(); long CPU Time=End-Start; To compute CPU time in C++use the following The runtime of a function can be computed in C++ as follows: 1) Get the timepoint before the function is called #include