I need help please.

1. Big sum problem You will implement the big sum arithmetic supported in the calculator (attached below)!!! Scientific 1125899906842624 + 2^50 = 2,251,799,813,685,248 DEG F-E MC MR M+ M- MS " A Trigonometry f Function 2nd TT e CE x2 Vx exp mod 2x ) n! . 7 8 9 10 4 5 6 log 1 2 3 + In +/- 0 Input : Large size two integers at most 20 digits long. Output: Sum of the two integers. Hint: Declare two integer type of array of size a[20], b[20] and assign / initialize them with input. Declare array of size c[22] for storing the output. Next, write a for loop and start adding from the least significant digits of a and b and assign the results back to c. Define a separate function that accepts three arguments as a,b,c and implement the big sum arithmetic inside the function. You need to call that function from the main function and print the result in the main function. (e.g. use the pointer concept) Ma 1. Big sum problem You will implement the big sum arithmetic supported in the calculator (attached below)!!! Scientific 1125899906842624 + 2^50 = 2,251,799,813,685,248 DEG F-E MC MR M+ M- MS " A Trigonometry f Function 2nd TT e CE x2 Vx exp mod 2x ) n! . 7 8 9 10 4 5 6 log 1 2 3 + In +/- 0 Input : Large size two integers at most 20 digits long. Output: Sum of the two integers. Hint: Declare two integer type of array of size a[20], b[20] and assign / initialize them with input. Declare array of size c[22] for storing the output. Next, write a for loop and start adding from the least significant digits of a and b and assign the results back to c. Define a separate function that accepts three arguments as a,b,c and implement the big sum arithmetic inside the function. You need to call that function from the main function and print the result in the main function. (e.g. use the pointer concept) Ma