Draw the recursion tree for the \text{MERGE-SORT}MERGE-SORT procedure from Section 2.3.1 on an array of 1616 elements. Explain why memoization fails to speed up a good divide-and-conquer algorithm such as \text{MERGE-SORT}MERGE-SORT.

How do i get the most points, without any effort?

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.

What is the penalty for violating section 1201 of title 17 chapter 21 of the us code