Decision tree implementation

program should be able to read both data sets and treat the last value of each line as the class. Task is to correctly implement the ID3 algorithm and return the final tree without stopping early (both data sets can be learned perfectly, i.e. all leaves have an entropy of 0).