Problem #4 [20 pts]: 1) Write a method called public static int[] findRemainders (int[] a, int[] b) that accepts arrays of integers a and b, and retums a new array of the same size. Each element in the arrayc at a certain positionicontains the remainder of the division of the element in a by the element in b at the same position. For example, if arrays a and contain the values shown below, then array o will contain the values as follows: a 60 | 13 | 4 0 0 4 b 2 524150 0 0 3 4 0 -1 c[O] is the remainder after dividing a[0]by b[0]. If the element in bis 0 then the value in c (same position) is - 1. For example, c[5] is -1 because b[5=0. 2) Write a main method that creates two arrays of integers a and b of size 6 and then fills them with numbers of your choice (you can use the shorthandnotation). The program invokes the method find Remainders then prints the array c on the screen