Hello! I need help with below assignment.

Data Mining - Homework 3 Q1. Find all frequent patterns from the above dataset using the FP-Growth algorithm, assuming that minSupp =50% and minConf=80%. You should show at least all of the steps of, and the frequent patterns mined from, the complete leftmost chain of recursive calls of FP-Growth (the last of which does not call FP-Growth). Q2. Use the border-diff algorithm to find the minimal jumping emerging patterns that appear in t=2345 but not in N={3456,2479,2358}. Suppose the following are all of the frequent patterns found from some given dataset X (which contains 6 transactions): B:5,C:2,D:4, BD:3,CD:3. Q3. Compute the contingency table for B and D. Q4. Compute the following interestingness measure values for B and D: lift, kulc, IR, coherence, chisquare, all_confidence