Preview File Edit View Go Tools Window Help Screenshot 2021-02-08 at 16.10.50 Q Search Select all true statements about divide and conquer algorithms from below. Select one or more: Are always the fastest running algorithms Order of growth of run time is analysed by adding the cost of each line multiplied by the number of times it will execute The algorithm is called recursively on subset(s) of the input Can only be used with small input Order of growth of run time is analysed by solving the recurrence