python data structures in divide and conquer approachthe problem in handis divided into smaller sub-problems and then each problem is solved independently whenwe keep on dividing the sub problems into even smaller sub-problemswe may eventually reach stage where no more division is possible those "atomicsmallest possible sub-problem (fractionsare solved the solution of all sub-problems is finally merged in order to obtain the solution of an original problem broadlywe can understand divide-and-conquer approach in three-step process divide/break this step involves breaking the problem into smaller sub-problems sub-problems should represent part of the original problem this step generally takes recursive approach to divide the problem until no sub-problem is further divisible at this stagesub-problems become atomic in nature but still represent some part of the actual problem conquer/solve this step receives lot of smaller sub-problems to be solved generallyat this levelthe problems are considered 'solvedon their own merge/combine when the smaller sub-problems are solvedthis stage recursively combines them until they formulate solution of the original problem this algorithmic approach works recursively and conquer merge steps works so close that they appear as one