10. Use the divide-and-conquer approach to write an algorithm that finds the largest item in a list of n items. You cannot assume that your list is sorted! Your algorithm should consist of explicit, precise, unambiguous, mechanically-executable instructions (5 pts) Algorithm: MaximumValue (A,n) : Input: Output: Process