Please answer the questions correctly and and show clear and easy explained detailed workings explaining steps. Please really make sure its correct.

(a) Give a divide-and-conquer algorithm that computes the sum of an unsorted array A of n integers by splitting the array in two equal parts. (b) Why is your algorithm correct? (c) Why does your algorithm terminate? (d) Express the running time of your algorithm as a recurrence. (e) Solve the recurrence from (d). Assume that all constants hidden by big-O notation are 1