Select the TRUE statement about divide and conquer algorithms.
a. The number of recursive calls is NOT always same as the number of sub-problems
b. The base case in divide and conquer is solved using a brute force or direct approach
c. It is always desirable to select a divide and conquer algorithm over an iterative algorithm with the same time complexity