(1) Run the Apriori algorithm (mentally, not through any computer program) and compute Ci (candidate itemset) and L; (frequent itemset) for each iteration i. In computing C₁, please apply self-joining and pruning. Compare your answers with the following and select all the correct ones. C₁ = {m, o, n, k, e, y, d, a, u, c, i} and L₁ = {m, o, k, e} C₁ = {m, o, n, k, e, y,, d, a, u, c, i} and L₁ = {m, o, k, e, y} C₁ = {m, o, n, k, e, y, d, a, u, c, i} and L₁ = {m, n, o, k, e, y} C2 = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, ok, oe, ke} C₂ = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, ok, oe, ke, ky} C₂ = {mo, mk, me, my, ok, oe, oy, ke, ky, ey} and L2 = {mk, mn, ok, oe, ke, ky} C3 = {oke} and L3 = {oke} C3 = {oke, key} and L3 = {oke, key} C3 = {oke, key} and L3 = {oke} The following database has 5 transactions. Let min_sup = 60% and min_conf = 80%. TID Items_bought T100 {m, o, n, k, e, y} T200 {d, o, n, k, e, y} T300 {m, a, k, e} T400 {m, u, c, k, y} T500 {c, o, k, i, e}

A problem called S reduces to a problem called T if a T solver can be used as a subroutine to solve S. In pseudocode: Solves(...): ... SolveT(...) ... Assuming that this reduction is correct, answer the following questions regarding what the reduction tells us. If we know that an algorithm exists for solving Problem S, what does that tell us about Problem T? [ Select] If we know that an algorithm cannot exist for solving Problem S, what does that tell us about Problem T? [ Select] If we know that an algorithm exists for solving Problem T, what does that tell us about Problem S? [ Select ] [ Select ] An algorithm cannot exist for solving Problem S,r solving Problem T, what does that tell us about Nothing An algorithm exists for solving Problem S

Can you please solve a and b. The exercise is for a course call computer organization

Give a recursive definition for the set of all strings of a’s and b’s that begins with an a and ends in a b. Say, S = { ab, aab, abb, aaab, aabb, abbb, abab..} Let S be the set of all strings of a’s and b’s that begins with a and ends in a b. The recursive definition is as follows – Base:... Recursion: If u ∈ S, then... Restriction: There are no elements of S other than those obtained from the base and recursion of S.