You should complete the function and ensure it produces the correct output against all test cases possible within the constraints highlighted. The runtime of the program is important so it is best to use an algorithm in the code which will not timeout

Between Two Sets Problem Submissions Leaderboard Discussions There will be two arrays of integers. Determine all integers that satisfy the following conditions: 1. The elements of the first array are all factors of the integer being considered 2. The integer being considered is a factor of all elements of the second array Contest ends in 7 days Submissions: 0 Max Score: 25 Difficulty: Easy These numbers are referred to as being between the two arrays. Determine how many such numbers exist. Rate This Challenge: More Example a = [2,6] b = [24, 36] There are two numbers between the arrays: 6 and 12 6%2 = 0,6%6= 0,24%6 = 0 and 36%6=0 for the first value. 12%2 = 0.12%6=0 and 24%12 = 0,38%12 = 0 for the second value. Return 2. Function Description Complete the get TotalX function in the editor below. It should return the number of integers that are betwen the sets. getTotalX has the following parameter(s): int a[n) an array of integers int b[m). an array of integers Returns int: the number of integers that are between the sets Input Format The first line contains two space-separated integers, n and m, the number of elements in arrays and The second line contains n distinct space-separated integers ali] where 0