How can I write this recursive code by using constant size arrays instead of using calloc?

Question

I wrote the below resursive polynomial multiplication, a(x)*b(x)=c(x), algorithm "ka2" by using dynamic memory allocation i.e. using calloc, malloc, free exc. Inputs