In this program, you will simulate very large POSITIVE integers with arrays. Digits are stored in an array starting with the least significant at index 0. For example, an integer 123 is stored with 3 at index 0, 2 at index 1 and 1 at index 2. You may assume that the integers to be added or multiplied have at most 20 digits. Write the following functions:

int add(int x[], int sizex, int y[], int sizey, int res[]), which takes two arrays x and y and their respective sizes, performs addition and stores the result into the array res. Return the number of digits of the resulting sum (i.e. number of digits stored into res).

int multiply(int x[], int sizex, int y[], int sizey, int res[]), which takes two arrays x and y and their respective sizes, performs multiplication and stores the result into the array res. Return the number of digits of the resulting product (i.e. number of digits stored into res).

int divide(int x[], int sizex, int y[], int sizey, int res[]), which takes two arrays x and y and their respective sizes, performs integer division of x by y, and stores the result into the array res. Return the number of digits of the result.

int mod(int x[], int sizex, int y[], int sizey, int res[]), which takes two arrays x and y and their respective sizes, performs of x mod y, and stores the result into the array res. Return the number of digits of the result.

printNumber(int x[], int sizex), which prints the integer represented by array x.

a main() function that creates some numbers and tests the add, multiply, division and mod operations.