Decision Tree 8.0f20.0 points {graded} Which of these are true? Decision trees are built using a greedy algorithm Decision tree growth does not use a greedy algorithm Only strictly convex functions can be used to decide how to split at a node Only strictly concave functions can be used to decide how to split at a node Piecewise linear functions can be used to decide how to split at a node