Design a divide-and-conquer algorithm that finds a sub-arrayA[i, ..., j] such that A[i] + A[i + 1] + ... + A[j] is maximum and write recurrences relation, then, design an iterative algorithm and compare them.