In java language solution for

$1.$ Given two arrays A$,$ B of size N each storing the digits of a positive integer, $($a$)$ write a program to add the two integers and store the result in an array C of appropriate size. $($b$)$ write a program to multiply two integers and store the result in an array C of appropriate size. $2.$ Consider an array of size N containing numbers $1,2$ and $3($with repetitions$).$ The count of some of the number types can also be zero in the array. Arrange the array such that all numbers of the same type are together. For eg: if the input array is $[1,3,1,1,2,3,2],$ then the output array can be $[1,1,1,2,2,3,3].3.$ Fill up an array of size N in increasing order with first N of all numbers divisible by no primes other than $2,3$ and $5.$