Questions

$(1)$

Justify the formula for $C$ .

$(2)$

Describe a modular algorithm for computing $fg$ in ${\mbox{${\mathbb{Z}}$}}[x]$ .

$(3)$

Give an upper bound for the number of machine word operations requires by this algorithm.