set of frequent 3-itemsets: {1, 2, 3}, {1, 2, 4}, {1, 2, 5}, {1, 3, 4}, {2, 3, 4}, {2, 3, 5} a) List all candidate 4-itemsets that can be generated by combining any two 3-itemsets from the above list. b) Prune your list of the candidate 4-itemsets using the Apriori principle and list candidate 4-itemsets that survive the candidate pruning step. (Hint: a candidate 4-itemset cannot be frequent if any of its subset is not frequent. Also, note that any 3-itemset that is not in the above list is not frequent.

Create a list – l1 with element 1,2,3,4,5. Convert this list into an array name ar. What is the dimension of this array – one dimension, 2 dimension or multidimension What is the datatype of elements of array. Print the second element of an array. Create a nested list – l2 with three lists. Elements of each lists are – [1,2,3];[4,5,6];[7,8,9] Convert this list into an array ar2. What is the dimension of this array. Observe the parenthesis. Print 8 from this array. Without using list, create an array ar3, which has the even number from 2 -10. Use the np.arange(start, end, skip). Run the following code and observe the output.

Alert : Dont't submit AI generated answer and given step by step solution with proper explantion.