You have been "recruited" by your friend to develop a "huge tic-tac-toe". the game is very similar to regular tic-tac-toe except for the fact that the board is 1000 x 1000 rather than 3 x 3. (to win you must have all of your character(x or o) in consectutive slots) (10 points)
let tictactoe be a char 2d array.
char tictactoe[1000][1000];
note that every element in that array contains one of the following three values:
'o'
'x'
'e' : for empty/available.
your first task is to find out if 'x' can win in the first row. note that there is no need for
writing code to get input from the user. just write code to compute and print if 'x' has a possible win in the first row.

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