*be sub-divided usin**g same st**rategy. Due to this procedure, this algor*it*hm is also known as the greedy algor*ithm, as we have an excessive desire of lowering the *cost. This makes the root node a*… can be sub-divided using same strategy. Due to this procedure, this algorithm is also known as the **greedy algorithm**, as we have an excessive desire of lowering the cost. **This makes the root node as best predictor/cl…**