When we want to multiply two polynomials in algebra, we expand it the following way: (4x + 3) ? 2x 3 + 5x + 9 ? = 4x ? 2x 3 + 5x + 9 ? + 3 ? 2x 3 + 5x + 9 ? = 8x 4 + 20x 2 + 36x + 6x 3 + 15x + 27 = 8x 4 + 6x 3 + 20x 2 + 51x + 27 In the above example, we could represent the coefficients in array form as [3,4] and [9,5,0,2], i.e, in increasing order of degree from left to right. Write a program that takes the array-forms of the integer coefficients of two polynomials and computes the coefficients of the resulting polynomial (after multiplication) (in the same format as above). Answer format: (a) polymult.c #include #include #include #include int main(){ int n1; //Degree of the first polynomial + 1 int n2; //Degree of the second polynomial + 1 int n3; //Degree of product int i; scanf("%d", &n1); scanf("%d", &n2); int * a = malloc(n1*sizeof(int)); //First polynomial int * b = malloc(n2*sizeof(int)); //Second polynomial for(i=0; i scanf("%d", &a[i]); } for(i=0; i scanf("%d", &b[i]); } //Your code here //set n3 as the size of output array //Output array should be c. Initialise as the following: //int * c = malloc(n3*sizeof(int)); for(i=0; i printf("%d ", c[i]); } return 0; } (b) polymult.py n1 = int(input()) #Degree of the first polynomial + 1 n2 = int(input()) #Degree of the second polynomial + 1 a = [ ] #First polynomial b = [ ] #Second polynomial for i in range(n1): a.append(int(input())) for i in range(n2): b.append(int(input())) #Your code here #Set n3 as the size of output array #Output array should be c for i in range(n3): print(c[i])