The Kadanes algorithm is an efficient algorithm which can find the largest-sum subarray of an array of numbers. You are asked to apply the Kadanes algorithm to search for the string S = AAA from a text such as T = AAbcAAAdAeAf. Only one instance of the string S = AAA is required to be found if multiple such strings exist in the text. Explain how to transform the string search problem so that the Kadanes algorithm is applicable for this task.