2. Now, consider the divide and conquer algorithm for polynomial multiplication. The algorithms works as follows: Let POx) po p1x p2x2 pnx" and Q(x) qo q1x q2x2 anx" be two polynomials of size n. Assume n 2 We divide the polynomials POx) and Q of size n into 4 sub (x) problems of size n/2 as follows: P2(x) p p nx p 1 hen, P(x) q X2 n-n/2 q 1 Then, Q(x) Q1 (x) n/2. Therefore, P(x) Q(x)