Decision Tree $(30$P$)$

Given the following dataset for a classification problem, construct a decision tree using the Gini index to determine the best splits.

$\backslash$table$[[$Data Point,Income,Student,Credit Rating,Buys Computer$],[1,$High,No$,$Fair,No$],[2,$High,No$,$Excellent,No$],[3,$High,Yes,Fair,Yes$],[4,$Medium,No$,$Fair,Yes$],[5,$Low,Yes,Fair,Yes$],[6,$Low,Yes,Excellent,No$],[7,$Low,No$,$Fair,No$],[9,$Medium,No$,$Fair,Yes$],[10,$Medium,Yes,Yes,Yes$]]$