Submission Guidelinesl Assignments should be submitted to[email protected] as attachments.l Attachmentsshouldbenamedintheformatof:Ax_itsc_stuid.zip.e.g.for a student with ITSC account: zxuav, student id: 20181234, the 1st assignment should be named as: A1_zxuav_20181234.zip.l Youneedtozipthefollowingthreefilestogether:1)A1_itsc_stuid_answer.pdf: please put all your answers in this document including the readme pages and output answers for Q1 Q2.2)A1_itsc_stuid_Q1_code: this is a folder that should contain all your source code forQ1.3)A1_itsc_stuid_Q2_code: same asabovel Forprogramminglanguage,inprinciple,pythonispreferred.l TAwillcheckyoursourcecodecarefully,soyourcodeMUSTberunnable, your result MUST bereproducible.l Keep your code clean and comment it clearly. Missing the necessary commentswillbedeductedacertainscore.l Yourgradewillbebasedonthecorrectness,efficiencyandclarity.l Pleasecheckcarefullybeforesubmittingtoavoidmultiplesubmissions.l SubmissionsafterthedeadlineornotfollowingtherulesaboveareNOTaccepted.l Plagiarismwillleadtozeropoints.(Please read the guidelines carefully)Q1. Hash Tree (40 marks)·Suppose we have 35 candidate item sets of length3:{1 2 4}, {1 2 9}, {1 3 5}, {1 3 9}, {1 4 7}, {1 5 8}, {1 6 7}, {1 7 9}, {1 89}{2 3 5}, {2 4 7}, {2 5 6}, {2 5 7}, {2 5 8}, {2 6 7}, {2 6 8}, {2 6 9}, {2 78}{3 4 5}, {3 4 7}, {3 5 7}, {3 5 8}, {3 6 8}, {3 7 9}, {3 8 9},{4 5 7}, {4 5 8}, {4 6 7}, {4 6 9}, {4 7 8},{5 6 7}, {5 7 9}, {5 8 9}, {6 7 8}, {6 7 9}The hash function is shown in the figure below.(a)Please write a program to generate a hash tree with max leaf size 2, output the nested list (or nested dict) of the hash tree hierarchically and draw the structure of the hash tree (you can write program to draw this hash tree or just manually draw it according to the nested list you output). Please write the nested list/dict and the hash tree together in the A1_itsc_stuid_answer.pdf.(35marks)l Give anexample:The nested list is (underline is just to make the structure clearer, you don t need to draw it in your assignment):The corresponding hash tree is:(b)Given a transaction that contains items {1, 2, 4, 6, 8, 9}, how many comparisons are needed using the hash tree which you generate above? Please circle these candidates in the hash tree. No programming required. (5 marks)Notes:1.You MUST code by yourself to complete thealgorithm.2.The hash tree must be constructed by your algorithm. In other words, if the datasetchanges,youralgorithmshouldalsooutputthecorrectanswer.Q2. FP-Tree (60 marks)Frequent Pattern Mining is very important for the retail industry to increase profits. Suppose you are the owner of a grocery, there is a sale records of your store.Data Description:groceries.csv: This is a .csv file that contains totally 9835 records and each record records every single transaction in the grocery store. The following table is an example ofit.

所有的编程代写范围：essayghost为美国、加拿大、英国、澳洲的留学生提供C语言代写、代写C语言、C语言代做、代做C语言、数据库代写、代写数据库、数据库代做、代做数据库、Web作业代写、代写Web作业、Web作业代做、代做Web作业、Java代写、代写Java、Java代做、代做Java、Python代写、代写Python、Python代做、代做Python、C/C++代写、代写C/C++、C/C++代做、代做C/C++、数据结构代写、代写数据结构、数据结构代做、代做数据结构等留学生编程作业代写服务。