Suppose that Algorithm1 has the running time (nlog2n) steps for input size n. Suppose that 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)=(n2) steps to combine the solutions to get a solution to the original input. Which algorithm is more efficient, Algorithm1 or the Divide-and-Conquer algorithm? Both algorithms have the same running time complexity. The Divide-and-Conquer algonsthm is more efficient than the Algorithm1. Algorithm 1 is more efficient than the Divide-and-Conquer algorithm. Default