$(10$ Marks$)$ Consider the following table

$\backslash$table$[[$Object$,$Height,Hair,Eyes,Class$],[o_1,$short,blond,blue,P$],[o_2,$short,blond,brown,N$],[o_3,$short,blond,brown,N$],[o_4,$tall,blond,blue,P$],[o_5,$tall,dark,blue,Z$],[o_6,$tall,dark,blue,Z$],[o_7,$tall,dark,brown,Z$],[o_8,$tall,h red,blue,P$]]$

$($a$)$ Draw all decision trees that can be generated from this table.

$($b$)$ Draw the $($partial$)$ state space used in ID$3$ learning algorithm.