Write a function (using pointer parameters) that compares two integer arrays to see whether they are identical. The function returns 1 if they are identical, 0 otherwise.
(Hint: In binary search, the target value is compared with the array’s middle element. Since
the table is sorted, if the required value is smaller, we know that all values greater than the
middle element can be ignored. That is, in one attempt, we eliminate one half the list. This
search can be applied recursively till the target value is found.)