Suppose we have a straightforward Algorithm1 for a problem that does (nlogan) steps for inputs of size n. Suppose we devise a Divide-and-Conquer algorithm that divides an input into two inputs half as big, and does D(n)= (1) steps to divide the problem and C(n) = (na) steps to combine the solutions to get a solution to the original input. Determine whether the Divide-and-Conquer algorithm is more or less efficient than the Algorithm 1. Algorithm1 is more efficient than the Divide-and-Conquer algorithm. The Divide-and-Conquer algorithm is more efficient than the Algorithm 1