Please help with this problem.

1. Note: You must do this problem manually by hand-tracing the Apriori algorithm discussed in the lectures rather than using a third-party tool or program. Consider the following transaction database. Each row represents a single transaction in which the specified items have been purchased. Transaction ID Items Purchased 1 2 3 4 5 6 7 8 9 10 11 A,B,C,D B,C,D,E,G A,C,G,H,K B,C,D,E.K D,E,F,H,L A,B,C,D,E,L A,D,E,F,L B,1,K,L C,D,F,L A,B,D,E,K C,D,H,I,K B,C,E,K B,C,D,F A,B,C,D C,H,I,J A,E,F.H.L H,K,L A.B.D.H.K D,E,K B,C,D,E,H 12 13 14 15 16 17 18 19 20 (2 points) Applying the Apriori algorithm with minimum support of 30% find all the frequent itemsets in the data set. List them. b. (2 points) From the maximal frequent itemsets in part a, generate all association rules that meet a minimum confidence of 75%. List them. (2 points) In addition to the confidence also specify the Lift (improvement) values for each of the final set of rules you have discovered in part b. List them