Computer Science Algorithms Question: Let $A(x)=a_0+a_{1}x$ and $B(x)=b_0+b_{1}x.$ We are given a polynomial with the

following structure

$P(x)=A^5(x)+5A^4(x)B(x)+10A^3(x)B^2(x)+10A^2(x)B^3(x)+5A(x)B^4(x)+B^5(x),$

where $a_0,a_1,b_0,$ and $b_1$ are arbitrarily given coefficients. What is the minimum

number of multiplications do you need to find the value of $P(x)$ for any value of $x?$