Hello! I need help with the following question. Thank You

Draw a hash tree for the following set of 3-itemsets (as candidate 3-itemsets):

ACD,CDE, CEI,CIM,CNO. Use h(A)=0, h(C) = 1, h(D) = 2, h(E)=0, h(I)=1, h(K)=2, h(M)=0, h(N)=1, h(O)=2, h(U)=0, h(Y)=1.

Assume each non-leaf-level node can hold up to three itemsets. A left-level node is a node that cannot be split in the hash tree even when it is full