Consider as an input two arbitrarily long numbers described as arrays of digits 09, in particular given an array A of digits on indices 0...n, the array represents number n 10' - A[i]. i=0 The numbers are arbitrarily long, we cannot assume they would fit into a standard integer type. The result is again another array of digits in the same form as A and B. Write a pseudocode of an algorithm which multiplies two numbers specified by arrays as above (assume that the number of digits in an array A can be obtained using len(A), so above we would have n = len(A)). Estimate the complexity of your algorithm