Problem 2. (6 points). A grad student is working on Algorithm S to solve some problem. On this problem, the grad student came up with an algorithm that can solve the problem by breaking it up into 10 equal-sized pieces, recursively solving those problems, and combining the solutions together in O(n)time. What is the largest size that these recursive calls can be if she/he needs to beat a (n? log n) algorithm