Suppose that we have an existing transaction database tdb for which we have already mined the frequent patterns. also we have a new set of transaction δtdb that we are adding to tdb. given a fixed min support threshold, σ (e. g., σ = 0.5%), present in plain language the steps for an efficient incremental mining algorithm that can maximally use the previously mined information when a new set of transactions δtdb is added to the existing transaction database tdb.

Write a method named addall that could be placed inside the hashintset class. this method accepts another hashintset as a parameter and adds all elements from that set into the current set, if they are not already present. for example, if a set s1 contains [1, 2, 3] and another set s2 contains [1, 7, 3, 9], the call of s1.addall(s2); would change s1 to store [1, 2, 3, 7, 9] in some order. you are allowed to call methods on your set and/or the other set. do not modify the set passed in. this method should run in o(n) time where n is the number of elements in the parameter set passed in.

How might the success of your campaign be affected if you haven’t carefully completed all field data or if you accidentally insert the wrong merge field in the document?

Ihave been given the number of guns per 100, and the total firearm-related deaths per 100,000. i have to find the actual number of guns per country and actual number of gun-related deaths. if somebody could show me how to do 1 question, i can finish the rest, i am just confused. tia