In the SLP (Straight Line Program model of computation) we want to compute x63, given input x, using only 8 multiplications. (Per class divisions are NOT allowed but a constant number of additions, subtractions and shifts are OK.) Is this possible? Or do we need 10? An example of a SLP is given in Subject 1, page 5. We show a 10M (multiplication) schedule and the problem asks if there is a better one using only 8M. t1=xx;t2=t1t1;t3=t2t2;t4=t3t3;t5=t4t4 a=t4t5;b=at3;c=bt2;d=ct1; out =dx; print out