Finding Maximum Contiguous Subsequence Sum using divide-and-conquer approach-Given a sequence Q of n numbers (positive and negative), the maximum subsequence of Q is the contiguous subsequence that has the maximum sum among all contiguous subsequ