Assume that you are a programming for dBay a large internet retail company. You are asked to design a solution that can efficiently sort all of the orders for the day based upon the time that the order was received, compute using matrix multiplication the total price of an order, and efficiently find a single customer order using a binary search. Every day dBay receives about 10,000 orders. As the first step of the process you must develop either a flowchart or the pseudo code that details the implementation of a divide and conquer algorithm. Although there are many algorithms that follow a divide and conquer approach please select from one of the following to solve one of the key requirements of the project:

Merge Sort

Quick Sort

Binary Search

Matrix Multiplication

Your submission must first describe which of the three tasks you are solving (sorting, matrix multiplication, or binary search) and discuss, in your own words, why a divide and conquer approach is a good approach to solve the problem. As part of your discussion you should describe the problem in terms of its asymptotic complexity in relation to your chosen algorithm. You must provide enough detail in either your flowchart or pseudocode in terms of decisions, exchanges, and data flows required, such that an algorithm can be built in a high level language such as java using only your flowchart or pseudocode.