Task: Frequent Itemset Mining using FP$-$treePlease write a program to implement the FP$-$tree growth algorithm and find all frequent itemsets with support $>=400$ in the given dataset. Note that your program cannot call an existing implementation of FP$-$tree to do the job. Inputtopic$-$x$.$txt:The input file of your frequent pattern mining algorithms. Each line represents a transaction with indices of terms.format: term$1\_$index term$2\_$index term$3\_$index $...$Columns are separated by a space.vocab.txt:The dictionary that maps term index to term. format: term$\_$index term.Columns are separated by a space.Outputpattern$-$x$.$txt:This is the file you need to submit, which contains your results for this frequent pattern mining task. Each line represents a transaction with frequent itemsets sorted in descending order of support count.format: support$\_$count term$1$ term$2...$support$\_$count and term$1$ are separated by a tab, while terms are separated by a space.Here we give an example $($for illustrating purposes only$)$:$433$ rule association$430$ random$427$ finding$403$ mining patternEvaluationThis coding assignment will be evaluated based on the correctness of your program $(80\%),$ readability $(10\%),$ and efficiency $(10\%)$Sample InputYou can download the following $.$zip file for sample inputs. C$1-$data$-1.$zip