Apositive integer n is called prime if n > 1 and the only factors of n are 1 and n. it is known that a positive integer n > 1 is prime if n is not divisible by any prime integer m≤√n .the 1230th prime number is 10,007. let t be an integer such that 2 ≤ t ≤ 100,000,000. then t is prime if either t is equal to one of the first 1,230 prime numbers or t is not divisible by any of the first 1,230 prime numbers. write a program that declares an array of size 1,230 and stores the first 1,230 prime numbers in this array. the program then uses the first 1,230 prime numbers to determine if a number between 2 and 100,000,000 is prime. if a number is not prime, then output at least one of its prime factors.

Write a function called checkfactor that takes two arrays of positive numbers, firstnumberrow and secondnumberrow. checkfactor checks if the first entry in firstnumberrow is divisible by the first entry in secondnumberrow, and performs the same operation on the next array elements until all entries have been checked. all the numbers are positive and the number of entries in the arrays are the same. the function should return the identified divisible numbers in two row arrays named firstdivisible and seconddivisible. restrictions: branches or loops should not be used. the code must use the internal mod and logical functions. hint: the mod function should be used to determine if two numbers are divisible. ex: for num1 and num2 if mod(num1,num2) is 0, then the two numbers are divisible. this is matlab