Which among the following statements best describes our approach to learning decision trees

• A. identify the best partition of the input space and response per partition to minimise sumof squares error
• B. identify the best approximation of the above by the greedy approach (to identifying thepartitions)
• C. identify the model which gives the best performance using the greedy approximation(option (b)) with the smallest partition scheme
• D. identify the model which gives performance close to the best greedy approximation performance (option (b)) with the smallest partition scheme