For both questions part B

Simple c++ code

Q6. Analyze and evaluate the Quicksort algorithms as divided and conquer technique. A. Time complexity B. Implement the codes and trace the output for this example [... 3 ... 9 8 2 ... 7 6], fill the blanks by any numbers. Q12. Analyze and evaluate the binary search algorithms as divided and conquer technique. A. Time complexity. B. Implement the codes and trace the output for appropriate example