Which of the following is a Divide and Conquer algorithm?

Which of the following is a Divide and Conquer algorithm?Bubble SortSelection SortHeap SortMerge Sort

In computer science, divide and conquer is an algorithm design paradigm.       The divide-and-conquer paradigm is often used to find an optimal solution of a problem.      What is the correct definition for Divide and conquer approach in the given statements Stat A) The divide and conquer approach is an algorithm design technique that involves breaking down a problem recursively into sub problems until the sub problems become so small and trivial that they can be easily solved. The solutions to the sub problems are then combined to give a solution to the original problem.Stat B)It simply requires you to find a way of breaking the problem into sub problems, solving the trivial cases, and combining the solutions to the sub problems to solve the original problemA True B FalseA False B TrueA False B FalseA True B True

Steps in Divide and conquer process that takes a recursive approach is said to be:a.Divide or Breakb.Both Divide or Break and Merge or Combinec.Merge or Combined.Conquer  or Solve

Which of the following algorithm doesn’t come under divide and conquer algorithms:a. Binary Searchb.Merge Sortc.Noned. karatsuba algorithm

What are considered to be the two halves of the dividing conquer algorithm, mergesort ?Instruction: Choose all options that best answer the question. Answer ChoicesDivideSortingSearchingMerging