Implement the nave divide-and-conquer recursive method the one without the Gaussian trick for multiplication algorithm n-bit unsigned numbers two binary bits. In other words, the arity of your recursion tree will be 4, instead of 3. just that instead of 3, youll have 4 multiplications. Verify that the running time is the same as the nave algorithm O(n2).

Language-java