In this assignment, you will be implementing a regression tree from scratch. Each decision node will correspond to one of the features in train.csv, which is selected by choosing the feature that minimises loss. The features in train.csv and test.csv are either continuous-valued (i.e. falling within a range) or discrete-valued (i.e. one of N values). The competition uses mean squared loss for evaluation