Which problem$-$solving strategy involves breaking a problem into smaller, more manageable subproblems, solving each subproblem independently, and then combining the solutions to solve the original problem? $$a$.$ Divide and conquer $$b$.$ Backtracking $$c$.$ Dynamic programming $$d$.$ Branch and bound