• (A) identify the best partition of the input space and response per partition to minimise sum of squares error
• (B) identify the best approximation of the above by the greedy approach (to identifying the partitions)
• (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