Using the information given below, draw a hash tree

F. Draw a hash tree for the following set of 3-itemsets (pretending they are candidate 3- itemsets): ACD, ACE, EIK, EIM, MNO, NUY, CDK, CKO, EIO. Use h(A)=0, h(C) = 1, h(D) = 2, h(E)=0, h (U=1, h(K)=2, h(M)=0, h(N)=1, h(0)=2, h(U)=0, h(Y)=1. Assume each internal node can hold up to two itemsets