2. We consider the divide-and-conquer algorithm for large-integer multiplication and decide to divide each integer into three parts instead of two. What is the minimum number of multiplications we have to eliminate so that the resulting recursive algorithm would outperform the algorithm that divides into two parts? What is the minimum number to outperform the elementary school algorithm. Come up with a scheme to eliminate as many multiplications as you can. The more you eliminate the more points you get. Show all your reasoning for every part of this question. After you have eliminated as many multiplications as you can, write down the resulting recursive algorithm in full in pseudocode notation of the book.