III For questions with sequences, we constantly split the problem into a number of sub-problems that
are smaller instances of the same problem, and we try to solve the smaller problems recursively. We
called this type of algorithm __(6)__ (A) Dynamic programming (B) Divide and Quicksort (C) Greedy al- gorithms (D) conquer