I WILL GIVE DISLIKES $!!!$ IF ANYTHING WRONG HAPPENS IN MY QUESTION, BETTER SKIP IT$!!!$

Don't Give the solution and explaination. Describe a recursive algorithm to square any n$-$digit number in O$($nlog$35)$ time, SE$05$ by reducing the problem to squaring five $($n$/3+$O$(1))-$digit numbersDon't solve else I will Punish You. Hint: What is $($a$+$b$+$c$)2+($a $$ b $+$ c$)2?$I told you not to solve any part