Question 6: Below is yet another variant of the max_subseq_sum_collect function. Will this unction be able to produce the correct maximal subsum for all types of number sequences mixed, all positive, or all negative)? Vector max_subseq_sum_collect_randl (const Vector& vec, ints max) int k = rand_int(0, vec.size() - 1); init - vec[k); int maxsum = vec[K]; int localsum = 0; Vector int> maxseq; Vector localseq; for (int i = 0; i maxsum) maxsum localsum maxseq localseg: 1 if (localsum max_subseq_sum_collect_rand2 (const Vectors vec, int& max) int k = rand_int(0, vec.size() - 1); init = vec[k]; int maxsum = vec[k]; int localsum = 0; Vector int> maxseq; Vector int> localseq; for (int i = 0; i maxsum) [ ! maxsum - localsum maxseq - localse; } else if (localsum