Let$$s say our training set consists of n data points in d$-$dimensional space. At the top node of the tree, we have to pick a split, which involves choosing $($i$)$ a feature and $($ii$)$ a split value along that feature. How many possibilities do we need to try out, roughly? Hint: How many ways to choose a feature? And once we have a feature, what is the effective number of splits?