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

Write a method that accepts a string object as an argument and returns the number of words it contains. for instance, if the argument is "four score and seven years ago", the method should return the number 6. demonstrate the method in a program that asks the user to input a string and then passes that string into the method, printing out whatever the method returns.

Which option should u select to ignore all tracked changes in a document

Define a function printfeetinchshort, with int parameters numfeet and numinches, that prints using ' and " shorthand. ex: printfeetinchshort(5, 8) prints: 5' 8"