P $1.[3$ pts$]$ Use the method illustrated in class $($recursion trees in the textbook$)$ to derive

the solution to the following recurrence. Show your work.

$T(n)=2T(\frac{n}{4})+\sqrt[\phantom{2}]{n}.$

$P2.$ pts$]$ Describe a divide and conquer algorithm to compute the square of an $n-$digit

integer in $O(n^{lo{g}_{2}3})$ time, by reducing to the squaring of three $|$~$\frac{n}{2}$~$|-$digit integers.

Adding two numbers with $k$ digits, and shifting a number with $k$ digits take $O(k)$

time.

Your submission should include the following points:

Problem statement. You need not provide an example.

The main idea of the algorithm. Argue the correctness of your algorithm here,

by showing how the algebraic derivations are used by your algorithm.

Algorithm pseudo$-$code.

Running time analysis. You can directly use the solution of the recurrence

relation worked in class $($aka Master Theorem $/$ recursion trees section in the

text$).$

Hint: use the identity $xy=\frac{x^2+y^2-(x-y{)}^2}{2}.$

P $3.[3$ pts$]$ Describe a divide and conquer algorithm to compute the square of an $n-$digit

integer in $O(n^{lo{g}_{3}6})$ time, by reducing to the squaring of six $|$~$\frac{n}{3}$~$|-$digit integers.

Include the same points in your submission as for Problem P $2..$ Is this algorithm

asymptotically faster that your algorithm from $P2.?$

Hint: use the expression for $(x+y+z{)}^2.$