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

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

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

Merge sort uses which of the following technique to implement sorting? a. searching b. greedy algorithm c. backtracking d. divide and conquer e. dynamic programming